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
Proceedings ArticleDOI
Improving scratchpad allocation with demand-driven data tiling
TL;DR: A new comparability graph coloring allocator that integrates for the first time data tiling and SPM allocation for arrays by tiling arrays on-demand to improve utilization of the SPM.
Journal ArticleDOI
Efficient maximum matching algorithms for trapezoid graphs
TL;DR: This paper proposes an efficient maximum matching algorithm for finding a maximum matching in trapezoid graphs, and improves the complexity to $O(n(\log n)^2)$, and generalizes this algorithm to a larger graph class, namely $k$-trapezoids graphs.
Proceedings ArticleDOI
Counting Euler Tours in Undirected Bounded Treewidth Graphs
TL;DR: In this paper, it was shown that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel by proving a GapL upper bound, which is in stark contrast to #P-completeness of the same problem in general graphs.
Book ChapterDOI
Recognition and Orientation Algorithms for P4-Comparability Graphs
TL;DR: These algorithms are simple, use simple data structures, and have the advantage over those of Raschle and Simon in that they are non-recursive, require linear space and admit effcient parallelization.
Posted Content
An Efficient Representation for Filtrations of Simplicial Complexes
TL;DR: A new data structure called the Critical Simplex Diagram (CSD), which is a variant of the Simplex Array List, allows one to store in a compact way the filtration of a simplicial complex and allows for the efficient implementation of a large range of basic operations.
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.