A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585435 / rank
 
Normal rank
Property / zbMATH Keywords
 
depth-first search
Property / zbMATH Keywords: depth-first search / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning tree
Property / zbMATH Keywords: spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
trapezoid graphs
Property / zbMATH Keywords: trapezoid graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation graphs
Property / zbMATH Keywords: permutation graphs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3797233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Depth-First Search in $O(\log n)$ Parallel Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of special depth first search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominations in trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for minimum spanning tree using depth-first-search in an undirected graph / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00088-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979383396 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
scientific article

    Statements

    Identifiers