On the OBDD size for graphs of bounded tree- and clique-width (Q1011721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.01.022 / 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.1016/j.disc.2008.01.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087617949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of binary decision diagrams representing Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273871 / 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: Monadic second-order evaluations on tree-decomposable graphs / 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: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short encodings of planar graphs and maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of general unlabeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2004: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing graphs implicitly using almost optimal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: BDDs -- design, analysis, complexity, and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic topological sorting with OBDDs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.01.022 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:46, 10 December 2024

scientific article
Language Label Description Also known as
English
On the OBDD size for graphs of bounded tree- and clique-width
scientific article

    Statements

    On the OBDD size for graphs of bounded tree- and clique-width (English)
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    decision diagram
    0 references
    ordered binary decision diagram
    0 references
    tree-width
    0 references
    clique-width
    0 references
    cograph
    0 references

    Identifiers

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