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
The Foundations of Taxonomic Encoding
TL;DR: A formal structure, called a spanning set, is described, in which taxonomic encoding techniques can be characterized, and a lower bound for simple forms of encoding is proved and it is shown that, in general, finding minimal‐sized encodings is NP‐hard.
Journal ArticleDOI
Path parity and perfection
Hazel Everett,Celina M. H. de Figueiredo,Cláudia Linhares-Sales,Frédéric Maffray,Oscar Porto,Bruce A. Reed +5 more
TL;DR: Results of even pairs have become an important tool for proving that certain classes of graphs are perfect and for designing optimization algorithms on special classes of perfect graphs, including odd pairs.
Dissertation
A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases
TL;DR: In this paper, the authors studied the spill problem under SSA and several versions of the coalescing problem and devised a heuristic, called permutation motion, that is intended to be used with SSA-based splitting in place of more aggressive coalescing in a JIT context.
Proceedings ArticleDOI
Overcoming browser cookie churn with clustering
TL;DR: A novel method to cluster browser cookies into groups that are likely to belong to the same browser based on a statistical model of browser visitation patterns, and proposes a greedy heuristic algorithm for solving it.
Book ChapterDOI
Context-Free Groups and Bass–Serre Theory
Volker Diekert,Armin Weiß +1 more
TL;DR: This paper underlines that context-free groups play a major role in combinatorial group theory and shows that every context- free group is virtually free.
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.