Algorithmic graph embeddings (Q1391310): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29026733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum genus and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit points for average genus. I: 3-connected and 2-connected simplicial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit points for average genus. II: 2-connected non-simplicial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski-type theorems for average genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Ear Decompositions and Graph Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the maximum genus of a simplicial graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for imbedding cubic graphs in the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing networks with compact routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy for imbedding-distribution invariants of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective Planarity in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank

Latest revision as of 13:16, 28 May 2024

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

    Statements

    Algorithmic graph embeddings (English)
    0 references
    22 July 1998
    0 references
    0 references
    graph embeddings
    0 references
    0 references
    0 references