Probe distance-hereditary graphs

Authors:
Maw-Shang Chang;Ling-Ju Hung;Peter Rossmanith
Affiliations:
National Chung Cheng University, Min-Hsiung, Chia-Yi, Taiwan;National Chung Cheng University, Min-Hsiung, Chia-Yi, Taiwan;RWTH Aachen University, Aachen, Germany
Venue:
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Year:
2010

Citing 15
Cited 2

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Graph sandwich problems

Journal of Algorithms
Graph classes: a survey

Graph classes: a survey
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Chordal probe graphs

Discrete Applied Mathematics
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs

SIAM Journal on Discrete Mathematics
Partitioned probe comparability graphs

Theoretical Computer Science
Probe Matrix Problems: Totally Balanced Matrices

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Probe Ptolemaic Graphs

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On probe permutation graphs

Discrete Applied Mathematics
Characterisations and linear-time recognition of probe cographs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Recognition of probe cographs and partitioned probe distance hereditary graphs

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The PIGs full monty – a floor show of minimal separators

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Recognition of probe ptolemaic graphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Recognition of probe distance-hereditary graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph G = (V, E) is called a probe graph of graph class G if V can be partitioned into two sets P (probes) and N (nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain nonprobes. A graph is distance hereditary if the distance between any two vertices remains the same in every connected induced subgraph. Distance-hereditary graphs have been studied by many researchers. In this paper we give an O(nm)-time algorithm for recognizing probe graphs of distance-hereditary graphs.