The interval count of interval graphs and orders: a short survey
✍ Scribed by Cerioli, Márcia R.; S. Oliveira, Fabiano; Szwarcfiter, Jayme L.
- Book ID
- 113109411
- Publisher
- SciELO
- Year
- 2011
- Tongue
- English
- Weight
- 493 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0104-6500
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We survey recent research on combinatorial properties of interval orders and interval graphs. Topics include: optimization with an uncooperative partner, ramsey trails, sorting with partial information, tree width and graph decompositions, combinatorial extremal problems, shift graphs, Dedekind's en
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is ass
Intersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uu in the intersection digraph when the "source set" of u intersects the "terminal set" of u. Every n-vertex digraph is an intersection digraph of o