Not all planar digraphs have small cycle separators (Q1201868): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90189-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991407326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Depth-First Search in General Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Message Routing in Planar Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Message Routing in<i>c</i>-Decomposable Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for planar graph isomorphism and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and efficient solution of path algebra problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-processor algorithm for depth-first search in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Depth-First Searches I. Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Latest revision as of 14:13, 17 May 2024

scientific article
Language Label Description Also known as
English
Not all planar digraphs have small cycle separators
scientific article

    Statements

    Not all planar digraphs have small cycle separators (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    planar digraphs
    0 references
    cycle separators
    0 references
    0 references