Shortcutting Planar Digraphs (Q4862749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing on a free tree via complexity-preserving mappings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A separator theorem for graphs of bounded genus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. V. Excluding a planar graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank |
Latest revision as of 10:39, 24 May 2024
scientific article; zbMATH DE number 843717
Language | Label | Description | Also known as |
---|---|---|---|
English | Shortcutting Planar Digraphs |
scientific article; zbMATH DE number 843717 |
Statements
Shortcutting Planar Digraphs (English)
0 references
5 June 1996
0 references
shortcutting
0 references
planar digraph
0 references
logarithmic diameter
0 references