(Q55952666)

English

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

scholarly article by Kellogg S. Booth & George S. Lueker published December 1976 in Journal of Computer and System Sciences

In more languages

edit

Statements

instance of

scholarly article

0 references

title

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (English)

0 references

0 references

1

0 references

author name string

George S. Lueker

series ordinal

2

0 references

publication date

December 1976

0 references

published in

Journal of Computer and System Sciences

0 references

volume

13

0 references

issue

3

0 references

page(s)

335-379

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

On the Topology of the Genetic Fine Structure

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Optimal scheduling for two-processor systems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

On rigid circuit graphs

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Computing an st-numbering

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Incidence matrices and interval graphs

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

A characterization of comparability graphs and of interval graphs

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Efficient Planarity Testing

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Algorithmic Aspects of Vertex Elimination on Graphs

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Scheduling Graphs on Two Processors

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Gaussian Elimination is not Optimal

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0022-0000%2876%2980045-1

retrieved

7 January 2021

Identifiers

DOI

10.1016/S0022-0000(76)80045-1

0 references

DBLP publication ID

journals/jcss/BoothL76

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

ResearchGate publication ID

222125111

0 references

zbMATH Open document ID

0367.68034

0 references

(Q55952666)

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)