Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-39890-5_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Theta-Graphs and Other Constrained Spanners

English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

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

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

Π/2-Angle Yao Graphs Are Spanners

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

A Characterization of Weakly Bipartite Graphs

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

Terminal-Pairability in Complete Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy