Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271): 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: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033757 / rank
 
Normal rank
Property / zbMATH Keywords
 
split decomposition
Property / zbMATH Keywords: split decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
distance hereditary graphs
Property / zbMATH Keywords: distance hereditary graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
fully dynamic algorithms
Property / zbMATH Keywords: fully dynamic algorithms / rank
 
Normal rank

Revision as of 19:29, 29 June 2023

scientific article
Language Label Description Also known as
English
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
scientific article

    Statements

    Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    split decomposition
    0 references
    distance hereditary graphs
    0 references
    fully dynamic algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references