Counting endpoint sequences for interval orders and interval graphs

Alexander Belfer; Martin C. Golumbic

doi:10.1016/0012-365X(93)90353-U

Counting endpoint sequences for interval orders and interval graphs

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper we design and analyze efficient algorithms for counting the number of endpoint sequences representing a given interval graph or interval order. The results are based on the construction of a suitable tree data structure to represent multiple solutions. We describe the relation of our methods to PQ-trees and MPQ-trees. Finally, we discuss the connection of these structures with temporary reasoning.

Original language	English
Pages (from-to)	23-39
Number of pages	17
Journal	Discrete Mathematics
Volume	114
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(93)90353-U
State	Published - 28 Apr 1993
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(93)90353-U

Cite this

@article{48650fdc5e7d48fe87e62b4fc8ea4ad9,

title = "Counting endpoint sequences for interval orders and interval graphs",

abstract = "In this paper we design and analyze efficient algorithms for counting the number of endpoint sequences representing a given interval graph or interval order. The results are based on the construction of a suitable tree data structure to represent multiple solutions. We describe the relation of our methods to PQ-trees and MPQ-trees. Finally, we discuss the connection of these structures with temporary reasoning.",

author = "Alexander Belfer and Golumbic, {Martin C.}",

year = "1993",

month = apr,

day = "28",

doi = "10.1016/0012-365X(93)90353-U",

language = "English",

volume = "114",

pages = "23--39",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Counting endpoint sequences for interval orders and interval graphs

AU - Belfer, Alexander

AU - Golumbic, Martin C.

PY - 1993/4/28

Y1 - 1993/4/28

N2 - In this paper we design and analyze efficient algorithms for counting the number of endpoint sequences representing a given interval graph or interval order. The results are based on the construction of a suitable tree data structure to represent multiple solutions. We describe the relation of our methods to PQ-trees and MPQ-trees. Finally, we discuss the connection of these structures with temporary reasoning.

AB - In this paper we design and analyze efficient algorithms for counting the number of endpoint sequences representing a given interval graph or interval order. The results are based on the construction of a suitable tree data structure to represent multiple solutions. We describe the relation of our methods to PQ-trees and MPQ-trees. Finally, we discuss the connection of these structures with temporary reasoning.

UR - http://www.scopus.com/inward/record.url?scp=38249001447&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(93)90353-U

DO - 10.1016/0012-365X(93)90353-U

M3 - Article

AN - SCOPUS:38249001447

SN - 0012-365X

VL - 114

SP - 23

EP - 39

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Counting endpoint sequences for interval orders and interval graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this