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

Lecture Notes in Computer Science - Germany
doi 10.1007/11602613_59
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

From Tree-Decompositions to Clique-Width Terms

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2010English

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Directed Tree-Width

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

A Lower Bound on the Tree-Width of Graphs With Irrelevant Vertices

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy