Golumbic M.Ch., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Graph Theoretic Models for Reasoning About - Time Martin Charles Self-citation (Golumbic) (Correct)
No context found.
M.C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs ", Academic Press, New York,
Two Tricks to Triangulate Chordal Probe Graphs in.. - Berry, Golumbic, Lipshteyn (2004) Self-citation (Golumbic) (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
On the Complexity of Cell Flipping in Permutation.. - Golumbic, Kaplan, Verbin (2005) Self-citation (Golumbic) (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Cell Flipping in Permutation Diagrams - Golumbic, Kaplan, Verbin (2003) Self-citation (Golumbic) (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Factoring and Recognition of Read-Once Functions Using.. - Golumbic, Mintz, Rotics (2004) Self-citation (Golumbic) (Correct)
No context found.
M.C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980.
The Role of Completeness in Convergence of - Evolutionary Algorithms Eugene (Correct)
No context found.
Golumbic M.Ch., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
BioSystems 82 (2005) 1--19 - Toward Theory Of (Correct)
No context found.
Golumbic, M.Ch., 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press.
Rankings of Graphs - Bodlaender, Deogun, Jansen, Kloks.. (1995) (2 citations) (Correct)
No context found.
M.C. GOLUMBIC. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Computations - Hans Bodlaender Department (2006) (Correct)
No context found.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Hans L. Bodlaender - Andreas Brandst Adt (2003) (Correct)
No context found.
M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York (1980) 28
On Exact Algorithms for Treewidth - Hans Bodlaender Fedor (2006) (Correct)
No context found.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Thomas Wolle - Arie Koster Hans (2004) (Correct)
No context found.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Discovering Treewidth - Hans Bodlaender Institute (2005) (Correct)
No context found.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Constraint Programming based Lagrangian Relaxation - For The Automatic (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1991.
Coupling Variable Fixing Algorithms - For The Automatic (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1991.
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch (Correct)
No context found.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
Chordal Probe Graphs (Extended Abstract) - Golumbic, Lipshteyn (Correct)
No context found.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York(1980).
Approximation Algorithms for the Job Interval Selection.. - Chuzhoy, Ostrovsky, al. (2001) (4 citations) (Correct)
No context found.
M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
Strongly orderable graphs - A common generalization of strongly.. - Dragan (2001) (Correct)
No context found.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Almost diameter of a house-hole-free graph in linear time via.. - Dragan (1999) (Correct)
No context found.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Clique r-Domination and Clique r-Packing Problems on.. - Brandstädt, Chepoi.. (1997) (Correct)
No context found.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Linear Time Algorithms for Hamiltonian Problems on.. - Brandstädt, Dragan.. (2000) (Correct)
No context found.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Dually Chordal Graphs - Brandstädt, Dragan, Chepoi, Voloshin (1998) (Correct)
No context found.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Detecting Deformable Objects with Flexible Shape Priors - Chang, Liu (2004) (Correct)
No context found.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
LexBFS-orderings of distance-hereditary graphs with.. - Dragan, Nicolai (2000) (Correct)
No context found.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
First 50 documents Next 50
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