Open AccessProceedings Article
Graph sandwich problems.
Martin Charles Golumbic
- pp 10
Reads0
Chats0
TLDR
Concentrating mainly on properties characterizing subfamilies of perfect graphs, polynomial algorithms for several properties are given and NP-completeness proofs are given for comparability graphs, permutation graphs, and several other families.About:
This article is published in Cologne Twente Workshop on Graphs and Combinatorial Optimization.The article was published on 2011-01-01 and is currently open access. It has received 171 citations till now. The article focuses on the topics: Graph (abstract data type).read more
Citations
More filters
Journal ArticleDOI
A survey of graph layout problems
TL;DR: A complete view of the current state of the art with respect to layout problems from an algorithmic point of view is presented.
Journal ArticleDOI
Four strikes against physical mapping of DNA.
TL;DR: It is shown that four simplified models of the physical mapping problem lead to NP-complete decision problems: Colored unit interval graph completion, the maximum interval subgraph, the pathwidth of a bipartite graph, and the k-consecutive ones problem for k > or = 2.
Journal ArticleDOI
Complexity Classification of Some Edge Modification Problems
TL;DR: This paper proves the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs, including perfect, chordal, chain, comparability, split and asteroidal triple free.
Journal ArticleDOI
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
TL;DR: This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in Allen's interval algebra, and shows that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalagbras is NP-complete.
Journal ArticleDOI
On the Complexity of DNA Physical Mapping
TL;DR: In this paper, the authors show that two simplified versions of the problem belong to the class of NP-complete problems, which are conjectured to be computationally intractable.
References
More filters
Proceedings ArticleDOI
Matrix multiplication via arithmetic progressions
Don Coppersmith,Shmuel Winograd +1 more
TL;DR: A new method for accelerating matrix multiplication asymptotically is presented, by using a basic trilinear form which is not a matrix product, and making novel use of the Salem-Spencer Theorem.
Journal ArticleDOI
Complement reducible graphs
TL;DR: It is shown that this family of graphs can be uniquely represented by a tree where the leaves of the tree correspond to the vertices of the graph.