Algorithmic graph embeddings (Q1391310)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Algorithmic graph embeddings	scientific article

Statements

scholarly article

0 references

Algorithmic graph embeddings (English)

0 references

Theoretical Computer Science

0 references

publication date

22 July 1998

0 references

zbMATH Keywords

graph embeddings

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the computational power of pushdown automata

0 references

A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus

0 references

Maximum genus and connectivity

0 references

Limit points for average genus. I: 3-connected and 2-connected simplicial graphs

0 references

Limit points for average genus. II: 2-connected non-simplicial graphs

0 references

Kuratowski-type theorems for average genus

0 references

Graph Ear Decompositions and Graph Embeddings

0 references

A tight lower bound on the maximum genus of a simplicial graph

0 references

An algorithm for imbedding cubic graphs in the torus

0 references

Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems

0 references

Designing networks with compact routing tables

0 references

0 references

Hierarchy for imbedding-distribution invariants of a graph

0 references

0 references

Efficient Planarity Testing

0 references

0 references

Projective Planarity in Linear Time

0 references

0 references

0 references

The graph genus problem is NP-complete

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0304-3975(96)00273-3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1391310

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