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 load-balanced multi-dimensional bin-packing problem
Alessio Trivella,David Pisinger +1 more
TL;DR: This paper considers the bin-packing problem with the practical extension of load balancing, i.e. to find the packing requiring the minimum number of bins while ensuring that the average center of mass of the loaded bins falls as close as possible to an ideal point, for instance, the center of the bin.
Journal ArticleDOI
Finding minimum height elimination trees for interval graphs in polynomial time
Bengt Aspvall,Pinar Heggernes +1 more
TL;DR: Clique trees are used to find an efficient algorithm for interval graphs which make an important subclass of chordal graphs, and this algorithm, although of exponential time complexity, is conceptionally simple and leads to a polynomial-time algorithm for finding minimum height elimination trees for interval graph orderings.
Journal ArticleDOI
On the Spectrum of Threshold Graphs
Irene Sciriha,Stephanie Farrugia +1 more
TL;DR: The antiregular connected graph on ǫ vertices as mentioned in this paper is defined as the connected graph whose vertex degrees take the values of 1 distinct positive integers, and the spectrum of its adjacency matrix is explored and shown common properties with those of connected threshold graphs.
Journal ArticleDOI
The Complexity of the List Partition Problem for Graphs
TL;DR: This work provides polynomial-time algorithms for many problems whose polynomially-time solvability was open, including the list 2-clique cutset problem, and classifies each list 4-partition problem as either solvable inPolynomial time or NP-complete.
Journal ArticleDOI
Embedding of cycles and wheels into arbitrary trees
TL;DR: This work estimates and characterize the edge congestion‐sum measure for embeddings of various graphs such as cycles, wheels, and generalized wheels into arbitrary trees and produces optimal values of sum of dilations and sum of edge‐congestions in linear time.
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.