A linear-time algorithm for finding all feedback vertices (Q1250830): 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(78)90015-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081123373 / 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: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / 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: Finding Dominators in Directed Graphs / rank
 
Normal rank

Latest revision as of 23:28, 12 June 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for finding all feedback vertices
scientific article

    Statements

    A linear-time algorithm for finding all feedback vertices (English)
    0 references
    1978
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references