Extending partial representations of interval graphs (Q2408095): Difference between revisions

Revision as of 05:45, 4 July 2024

scientific article; zbMATH DE number 5916968

Extending Partial Representations of Interval Graphs

Language	Label	Description	Also known as
English	Extending partial representations of interval graphs	scientific article; zbMATH DE number 5916968	Extending Partial Representations of Interval Graphs

Statements

instance of

scholarly article

0 references

title

Extending partial representations of interval graphs (English)

0 references

Extending Partial Representations of Interval Graphs (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

9 October 2017

0 references

1 July 2011

0 references

full work available at URL

https://arxiv.org/abs/1306.2182

0 references

zbMATH Keywords

interval graphs

0 references

partial representation extension

0 references

PQ-trees

0 references

linear-time algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Maintaining knowledge about temporal intervals

0 references

Q5417619

0 references

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

0 references

Graph Classes: A Survey

0 references

A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

0 references

The LBFS Structure and Recognition of Interval Graphs

0 references

NP completeness of the edge precoloring extension problem on bipartite graphs

0 references

Incidence matrices and interval graphs

0 references

Algorithmic graph theory and perfect graphs

0 references

Complexity and algorithms for reasoning about time

0 references

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

0 references

Simultaneous Interval Graphs

0 references

Reasoning about temporal relations

0 references

Optimal greedy algorithms for indifference graphs

0 references

NP‐completeness of list coloring and precoloring extension on the edges of planar graphs

0 references

Topics in Intersection Graph Theory

0 references

Graph Drawing

0 references

Q5588432

0 references

Algorithmic Aspects of Vertex Elimination on Graphs

0 references

Identifiers

zbMATH Open document ID

1371.05190

0 references

1331.68107

0 references

DOI

10.1007/s00453-016-0186-z

0 references

10.1007/978-3-642-20877-5_28

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2408095

@@ Property / cites work @@
+Maintaining knowledge about temporal intervals
@@ Property / cites work: Maintaining knowledge about temporal intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417619
@@ Property / cites work: Q5417619 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+The LBFS Structure and Recognition of Interval Graphs
+Normal rank
@@ Property / cites work @@
+NP completeness of the edge precoloring extension problem on bipartite graphs
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for reasoning about time
+Normal rank
@@ Property / cites work @@
+Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
+Normal rank
@@ Property / cites work @@
+Simultaneous Interval Graphs
@@ Property / cites work: Simultaneous Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about temporal relations
@@ Property / cites work: Reasoning about temporal relations / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal greedy algorithms for indifference graphs
@@ Property / cites work: Optimal greedy algorithms for indifference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
+Normal rank
@@ Property / cites work @@
+Topics in Intersection Graph Theory
@@ Property / cites work: Topics in Intersection Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588432
@@ Property / cites work: Q5588432 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank