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 hardness of approximating the boxicity, cubicity and threshold dimension of a graph
TL;DR: It is shown that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n^0^.^5^-^@e) for any @e>0 unless NP=ZPP.
Journal ArticleDOI
Data Integration in Poplar: 'Omics Layers and Integration Strategies.
Deborah Weighill,Timothy J. Tschaplinski,Timothy J. Tschaplinski,Gerald A. Tuskan,Daniel Jacobson,Daniel Jacobson +5 more
TL;DR: This review will summarize various ‘omics data layers, focusing on their application in Populus species, and network and signal processing techniques for the integration and analysis of these data types will be discussed.
Journal ArticleDOI
The NTree: a two dimension partial order for protection groups
TL;DR: Refinement allows a complex ntree to be developed incrementally in a top-down manner and is useful for the initial definition of an ntree as well as for subsequent modifications.
Journal ArticleDOI
Packing r-Cliques in Weighted Chordal Graphs
TL;DR: This paper considers a weighted version of the above min-max optimization problem, given a chordal graph G, with a nonnegative weight for each r-clique in G, and presents two algorithms to solve this problem, based on the principle of complementary slackness.
Journal ArticleDOI
Spectral characterizations of anti-regular graphs
TL;DR: In this paper, the eigenvalues of the unique connected anti-regular graph A n were studied using Chebyshev polynomials of the second kind, and it was shown that the bipartite character of A n is characterized by a trigonometric equation whose roots are the eigvalues.
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.