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
Towards Linkage Analysis with Markers in Linkage Disequilibrium by Graphical Modelling
TL;DR: An approach combining these methods to compute linkage statistics when alleles at the marker loci are in linkage disequilibrium is outlined, and how this still experimental approach might be further developed is discussed.
Using topic salience and connotational drifts to detect candidates to semantic change
Armelle Boussidan,Sabine Ploux +1 more
TL;DR: This research uses ACOM, a co-occurrence based geometrical model, which is an extension of the Semantic Atlas, which allows for extremely detailed analysis and provides insight as to how connotational drift processes unfold.
Journal ArticleDOI
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
TL;DR: In this article, it was shown that the existence of a thick Hamiltonian vertex ordering will guarantee that the graph has various kinds of spanning connectedness properties and that for interval graphs, quite a few seemingly unrelated spanning connections are equivalent to the presence of a heavy vertex ordering.
Proceedings ArticleDOI
Comparability graph coloring for optimizing utilization of stream register files in stream processors
TL;DR: A compiler algorithm is presented that can find optimal or near-optimal colorings in stream IGs, thereby improving SRF utilization than the First-Fit bin-packing algorithm, the best in the literature.
Journal ArticleDOI
The hardness of intervalizing four colored caterpillars
TL;DR: It is shown that the ICG problem is NP-complete when the graph is a caterpillar tree, colored with k ⩾4 colors, and strengthen the cases for which the problem remains difficult.
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.