Compact representation of graphs of small clique-width (Q724221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-017-0365-6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-017-0365-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2750884281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet Partitioning for Compressed Rank/Select and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Separable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query efficient implementation of graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of partner-limited graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Representation of Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact navigation and distance oracles for graphs with small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform paradigm to succinctly encode various families of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select operations on large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the OBDD size for graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Functional Static and Dynamic Succinct Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833659 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-017-0365-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:01, 10 December 2024

scientific article
Language Label Description Also known as
English
Compact representation of graphs of small clique-width
scientific article

    Statements

    Compact representation of graphs of small clique-width (English)
    0 references
    0 references
    0 references
    25 July 2018
    0 references
    clique-width
    0 references
    navigation oracles
    0 references
    compact representation
    0 references

    Identifiers