Symbolic graphs: Linear solutions to connectivity related problems (Q2471809): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alberto Policriti / rank
Normal rank
 
Property / author
 
Property / author: Alberto Policriti / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 447 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUDD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VIS / 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-007-9079-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125161077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the variable ordering of OBDDs is NP-complete / 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: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary decision diagrams in theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation minimization and symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219538 / 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: Verification of reactive systems. Formal methods and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonapproximability of OBDD minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing language containment for \(\omega\)-automata using BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BDDs -- design, analysis, complexity, and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:14, 27 June 2024

scientific article
Language Label Description Also known as
English
Symbolic graphs: Linear solutions to connectivity related problems
scientific article

    Statements

    Symbolic graphs: Linear solutions to connectivity related problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2008
    0 references
    0 references
    Strongly connected components
    0 references
    Biconnected components
    0 references
    Ordered binary decision diagrams
    0 references
    Model checking
    0 references
    Massive graphs
    0 references
    0 references
    0 references
    0 references
    0 references