Succinct representations of graphs
From MaRDI portal
Recommendations
Cited in
(57)- Linear connectivity problems in directed hypergraphs
- The complexity of combinatorial problems with succinct input representation
- On matroids and hierarchical graphs
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Succinct representation, leaf languages, and projection reductions
- Succinctness as a source of complexity in logical formalisms
- Symbolic model checking for -calculus requires exponential time
- Automated competitive analysis of real-time scheduling with graph games
- Functions computable in polynomial space
- Complexity, appeal and challenges of combinatorial games
- A framework for analysing state-abstraction methods
- The minimum oracle circuit size problem
- The complexity of searching implicit graphs
- Languages represented by Boolean formulas
- Succinct algebraic branching programs characterizing non-uniform complexity classes
- scientific article; zbMATH DE number 3883612 (Why is no real title available?)
- scientific article; zbMATH DE number 3874609 (Why is no real title available?)
- scientific article; zbMATH DE number 4213461 (Why is no real title available?)
- Equality Testing of Compressed Strings
- Specular sets
- Compressed tree canonization
- scientific article; zbMATH DE number 3968574 (Why is no real title available?)
- The difference and truth-table hierarchies for NP
- The computational complexity of graph problems with succinct multigraph representation
- Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
- scientific article; zbMATH DE number 4110112 (Why is no real title available?)
- Succinct encoding of arbitrary graphs
- Model-checking hierarchical structures
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- The complexity of approximating \(\mathrm{PSPACE}\)-complete problems for hierarchical specifications
- The complexity of searching succinctly represented graphs
- A note on succinct representations of graphs
- scientific article; zbMATH DE number 4115979 (Why is no real title available?)
- Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results
- On matroids and hierarchical graphs
- Synthesis for multi-weighted games with branching-time winning conditions
- CNF and DNF succinct graph encodings
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Succinct Encodings of Graph Isomorphism
- Representing graphs implicitly using almost optimal space
- The complexity gap in the static analysis of cache accesses grows if procedure calls are added
- Hierarchically specified unit disk graphs
- Transformations of probability distributions
- Succinct circuit representations and leaf language classes are basically the same concept
- The complexity of bounded context switching with dynamic thread creation
- Hardness of monadic second-order formulae over succinct graphs
- Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
- About the infinite windy firebreak location problem
- Incremental algorithms for solving regular expression intersection non-emptiness
- Bounded-depth succinct encodings and the structure they imply on graphs
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- On the succinct representation of graphs
- Trading uninitialized space for time
- On the complexity of kings
- Approximating schedules for dynamic process graphs efficiently
This page was built for publication: Succinct representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325058)
