The computational complexity of graph problems with succinct multigraph representation
From MaRDI portal
Recommendations
Cites work
- A note on succinct representations of graphs
- A taxonomy of problems with fast parallel algorithms
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 4009832 (Why is no real title available?)
- Matching is as easy as matrix inversion
- Perfect matching for regular graphs is AC^ 0-hard for the general matching problem
- Succinct representations of graphs
- The binary network flow problem is logspace complete for P
Cited in
(13)- The complexity of combinatorial problems with succinct input representation
- Representations of graphs and networks (coding, layouts and embeddings)
- Succinct representation, leaf languages, and projection reductions
- Some observations on holographic algorithms
- On the complexity of data disjunctions.
- Languages represented by Boolean formulas
- Complement, complexity, and symmetric representation
- Solving computational problems in the theory of word-representable graphs
- Succinct representations of graphs
- scientific article; zbMATH DE number 3874609 (Why is no real title available?)
- scientific article; zbMATH DE number 4110112 (Why is no real title available?)
- scientific article; zbMATH DE number 219271 (Why is no real title available?)
- The complexity of semilinear problems in succinct representation
This page was built for publication: The computational complexity of graph problems with succinct multigraph representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801600)
