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
Journal ArticleDOI
Separability generalizes Dirac's theorem
Anne Berry,Jean-Paul Bordat +1 more
TL;DR: This work defines a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph, and generalizes Dirac's theorem to any undirected graph: “Every non-clique graph has at least two non-adjacent moplexes”.
Journal ArticleDOI
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
TL;DR: An algorithm is given that approximates sum coloring within a factor of 1.796, for any graph in which the maximum k-colorable subgraph problem is polynomially solvable, and a new measure of coloring, robust throughput}, that indicates how “quickly” the graph is colored, is introduced.
Book ChapterDOI
On the k-Coloring of Intervals
TL;DR: An O(k+n) time algorithm is provided for k-coloring a maximum cardinality subset of the intervals of k colors, which provides improved solutions to problems of local register allocation, task scheduling, and the routing of nets on a chip.
Journal ArticleDOI
Preprocessing rules for triangulation of probabilistic networks
TL;DR: The experimental results show that the graphs of some well‐known real‐life probabilistic networks can be triangulated optimally just by preprocessing; for other networks, huge reductions in their graph's size are obtained.
Journal ArticleDOI
Treewidth of chordal bipartite graphs
Ton Kloks,Dieter Kratsch +1 more
TL;DR: A polynomial time algorithm is presented for the exact computation of the treewidth of all chordal bipartite graphs in which every cycle of length at least six has a chord.
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.