Q2702747 (Q2702747): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:39, 3 June 2024

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

Jože Marinček

0 references

0 references

0 references

publication date

13 March 2001

0 references

full work available at URL

https://eudml.org/doc/34454

0 references

zbMATH Keywords

algorithm

0 references

graph

0 references

embedding

0 references

bridge

0 references

Kuratowski subgraph

0 references

MaRDI profile type

MaRDI publication profile

0 references

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

0 references

A linear algorithm for embedding planar graphs using PQ-trees

0 references

Time bounded random access machines

0 references

A Depth-First-Search Characterization of Planarity

0 references

0 references

Efficient Planarity Testing

0 references

Convex representations of maps on the torus and other flat surfaces

0 references

A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

0 references

0 references

0 references

Embedding Graphs in the Plane—Algorithmic Aspects

0 references

Depth-First Search and Kuratowski Subgraphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2702747

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2702747&oldid=34269623"