Journal ArticleDOI
Algorithmic graph theory and perfect graphs
Reads0
Chats0
About:
This article is published in Order.The article was published on 1986-06-01. It has received 1324 citations till now. The article focuses on the topics: Trivially perfect graph & Perfect graph theorem.read more
Citations
More filters
Book ChapterDOI
Graph Searching on Chordal Graphs
TL;DR: Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Book ChapterDOI
Proper Helly circular-arc graphs
TL;DR: The results are extended to graphs which admit a model which is simultaneously unit and Helly, also leading to characterizations and a linear time certifying algorithm.
Book ChapterDOI
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4’s
TL;DR: It is shown that the simple max-cut problem can be solved in linear time for a graph that is both split and indifference, and that for each constant q, the simplemax- cut problem can been solved in polynomial time for (q,q-4)-graphs.
Journal ArticleDOI
An efficient algorithm to generate all maximal cliques on trapezoid graphs
TL;DR: To find all maximal cliques of a trapezoid graph a set of intervals have been constructed by projecting the geometrical representation of the graph on the bottom line by taking O(n 2 + yn) time.
Book ChapterDOI
Supertree Methods for Ancestral Divergence Dates and other Applications
TL;DR: A way to incorporate divergence time information in a fast and exact supertree algorithm that extends the classic Build algorithm is described, which is somewhat flexible in that it allows any combination of relative and/or absolute divergence times.
References
More filters
Journal ArticleDOI
Interval graphs and related topics
TL;DR: A more general paradigm for studying various classes of graphs is suggested which can be described as follows: when 9 is allowed to be an arbitrary family of sets, the class obtained as intersection graphs is all undirected graphs.