Distance Approximating Trees for Chordal and Dually Chordal Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-63397-9_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

NC Algorithms for Recognizing Chordal Graphs and K Trees

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1988English

An Introduction to Chordal Graphs and Clique Trees

1992English

Clique R-Domination and Clique R-Packing Problems on Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1997English

Long Paths and Toughness of K-Trees and Chordal Planar Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Precoloring Extension on Chordal Graphs

English

Clique-Cutsets Beyond Chordal Graphs

Journal of Graph Theory
GeometryTopology
2018English

A Separator Theorem for Chordal Graphs

SIAM Journal on Algebraic Discrete Methods
1984English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing
MathematicsComputer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy