(Enter summary)
Abstract: A graph G = (V; E) is chordal probe if its vertices can be partitioned into two sets P (probes)
and N (non-probes) where N is a stable set and such that G can be extended to a chordal
graph by adding edges between non-probes. The study of chordal probe graphs was originally
motivated as a generalization of the interval probe graphs which occur in applications involving
physical mapping of DNA. However, chordal probe graphs also have their own computational
biology application as a special... (Update)
Cited by: More
Weaving through a Crowd of Minimal Separators - Berry (2003)
(Correct)
Active bibliography (related documents): More All
1.8: Recognizing and Triangulating Chordal Probe Graphs - Berry, Golumbic, Lipshteyn (2003)
(Correct)
1.2: Graph Extremities and Minimal Separation - Berry (2003)
(Correct)
0.7: Chordal Probe Graphs (Extended Abstract) - Golumbic, Lipshteyn
(Correct)
Similar documents based on text: More All
0.3: Supporting Collaborative Activity - Hadad, Armon-Kest, Kaminka, Kraus (2005)
(Correct)
0.2: Complexity and Algorithms for Reasoning About Time: A.. - Golumbic, Shamir (1992)
(Correct)
0.2: Cell Flipping in Permutation Diagrams - Golumbic, Kaplan (2001)
(Correct)
BibTeX entry: (Update)
A. Berry, M.C. Golumbic, and M. Lipshteyn. Two tricks to triangulate chordal probe graphs in polynomial time. Proceedings of Soda 2004, 2004. http://citeseer.ist.psu.edu/berry04two.html More
@misc{ berry04two,
author = "A. Berry and M. Golumbic and M. Lipshteyn",
title = "Two tricks to triangulate chordal probe graphs in polynomial time",
text = "A. Berry, M.C. Golumbic, and M. Lipshteyn. Two tricks to triangulate chordal
probe graphs in polynomial time. Proceedings of Soda 2004, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/berry04two.html" }
Citations (may not include all citations):
488
Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
97
Incidence matrices and interval graphs (context) - Fulkerson, Gross - 1965
90
On rigid circuit graphs (context) - Dirac - 1961
25
Graph sandwich problems
- Golumbic, Kaplan et al. - 1995
21
How to use the minimal separators of a graph for its chordal..
- Parra, Sche - 1995
16
Representation of a nite graph by a set of intervals on the .. (context) - Lekkerkerker, Ch - 1962
11
A wide-range ecient algorithm for minimal triangulation (context) - Berry - 1999
9
Construction of probe interval models
- McConnell, Spinrad - 2002
8
A polynomial time recognition algorithm for probe interval g.. (context) - Johnson, Spinrad - 2001
7
A wide-range algorithm for minimal triangulation from an arb..
- Berry, Bordat et al.
6
Discrete Applied Mathematics (context) - McMorris, Wang et al. - 1998
6
Cambridge University Press (context) - Golumbic, Trenk - 2003
6
SIAM Monographs on Discrete Mathematics and Applications (context) - McKee, McMorris et al. - 1999
5
Chordal probe graphs (context) - Golumbic, Lipshteyn - 2003
3
Recognizing and triangulating chordal probe graphs
- Berry, Golumbic et al. - 2003
3
Probe interval graphs and their application to physical mapp.. (context) - Zhang - 1994
2
Cycle free probe interval graphs (context) - Sheng - 1999
Documents on the same site (http://www.cri.haifa.ac.il/technical_reports.htm): More
The Recognition of k-EPT Graphs - Golumbic, Lipshteyn, Stern
(Correct)
Factoring and Recognition of Read-Once Functions Using.. - Golumbic, Mintz, Rotics (2004)
(Correct)
An Extension of the Greene and Greene-Kleitman Theorems to all.. - Hartman (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC