Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(03)00424-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

NC Algorithms for Recognizing Chordal Graphs and K Trees

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1988English

Precoloring Extension on Chordal Graphs

English

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners

2018English

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

2020English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Distance Approximating Trees for Chordal and Dually Chordal Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

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

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

Privacy PolicyRefund Policy