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
On the performance of the First-Fit coloring algorithm on permutation graphs
TL;DR: It is proved that the largest number of colors χ FF (G) that the First-Fit coloring algorithm (FF) needs on permutation graphs of chromatic number χ(G)=χ when taken over all possible vertex orderings is not linearly bounded in terms of the off-line optimum.
Journal ArticleDOI
Partitioning Perfect Graphs into Stars
René van Bevern,René van Bevern,Robert Bredereck,Laurent Bulteau,Jiehua Chen,Vincent Froese,Rolf Niedermeier,Gerhard J. Woeginger +7 more
TL;DR: In this paper, the authors studied the problem of partitioning undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices.
Book ChapterDOI
Computing branchwidth via efficient triangulations and blocks
TL;DR: It is shown how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (2 + $\sqrt{\rm 3}$)$^{\it n}$ · nO(1).
Book ChapterDOI
Profit Maximization in Flex-Grid All-Optical Networks
TL;DR: This work focuses on bandwidth utilization in path toplogy and considers two wavelength assignment, or in graph theoretic terms coloring, problems where the goal is to maximize the total profit.
Book ChapterDOI
Population training heuristics
TL;DR: The Population Training Heuristic is described, guiding the population to settle down in search areas where the individuals can not be improved by such heuristics, and is compared against other approaches.
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.