Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 20:37, 27 June 2023

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
    recognition algorithm
    0 references
    breadth-first search
    0 references
    \(i\)-triangulated graph
    0 references
    graph algorithms
    0 references

    Identifiers