Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870): 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: 68T20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6594153 / rank
 
Normal rank
Property / zbMATH Keywords
 
recognition algorithm
Property / zbMATH Keywords: recognition algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
breadth-first search
Property / zbMATH Keywords: breadth-first search / rank
 
Normal rank
Property / zbMATH Keywords
 
\(i\)-triangulated graph
Property / zbMATH Keywords: \(i\)-triangulated graph / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1491628531 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Recognizing \(i\)-triangulated graphs in \(O(mn)\) time
scientific article

    Statements

    Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    recognition algorithm
    0 references
    breadth-first search
    0 references
    \(i\)-triangulated graph
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references