Author
Csaba P. Gabor
Bio: Csaba P. Gabor is an academic researcher from Princeton University. The author has contributed to research in topics: Outerplanar graph & Distance-hereditary graph. The author has an hindex of 2, co-authored 3 publications receiving 131 citations.
Papers
More filters
TL;DR: The main result of this paper is an 0.0-time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle.
Abstract: The main result of this paper is an 0([V] x [E]) time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. The algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices. Furthermore, as a substep of the algorithm, it is shown how to find in 0([V] x [E]) time a decomposition of a graph into prime graphs, thereby improving on a result of Cunningham.
110 citations
21 Oct 1985
TL;DR: This paper presents a polynomialtime algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices.
Abstract: Our main result is a polynomialtime algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. Our algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices.
24 citations
01 Jan 1985
TL;DR: In this article, a polynomial-time algorithm for deciding whether a given graph is a circle graph is presented, that is, the intersection graph of a set of chords on a circle.
Abstract: A graph G. A model for G. Abstract. Our main result is a polynolnial time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. Our algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor sim ilar pairs of vertices.
Cited by
More filters
Book•
17 Dec 1994
TL;DR: In this article, the Conjectures of Hadwiger and Hajos are used to define graph types, such as planar graph, graph on higher surfaces, and critical graph.
Abstract: Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms. Constructions. Edge Colorings. Orientations and Flows. Chromatic Polynomials. Hypergraphs. Infinite Chromatic Graphs. Miscellaneous Problems. Indexes.
1,380 citations
Book•
31 Jan 1993
TL;DR: This book is a core reference for graduate students and CAD professionals and presents a balance of theory and practice in a intuitive manner.
Abstract: From the Publisher:
This work covers all aspects of physical design. The book is a core reference for graduate students and CAD professionals. For students, concept and algorithms are presented in an intuitive manner. For CAD professionals, the material presents a balance of theory and practice. An extensive bibliography is provided which is useful for finding advanced material on a topic. At the end of each chapter, exercises are provided, which range in complexity from simple to research level.
927 citations
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
857 citations
Book•
09 Jul 2012TL;DR: In this article, the space of all knots and their relatives are discussed. But the authors focus on knots invariants and not on their relation to finite type invariants, and they do not consider Braids and string links.
Abstract: 1. Knots and their relatives 2. Knot invariants 3. Finite type invariants 4. Chord diagrams 5. Jacobi diagrams 6. Lie algebra weight systems 7. Algebra of 3-graphs 8. The Kontsevich integral 9. Framed knots and cabling operations 10. The Drinfeld associator 11. The Kontsevich integral: advanced features 12. Braids and string links 13. Gauss diagrams 14. Miscellany 15. The space of all knots Appendix References Notations Index.
232 citations
TL;DR: This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete.
Abstract: Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimal labeling, all solutions, and all realizations problems are considered for temporal (internal) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete
221 citations