The computational complexity of graph problems with succinct multigraph representation
From MaRDI portal
Publication:3801600
DOI10.1007/BF01928922zbMATH Open0655.05063MaRDI QIDQ3801600FDOQ3801600
Authors: Marek Karpinski, K. W. Wagner 
Publication date: 1988
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Recommendations
Cites Work
- Geometric algorithms and combinatorial optimization
- A taxonomy of problems with fast parallel algorithms
- Succinct representations of graphs
- A note on succinct representations of graphs
- Matching is as easy as matrix inversion
- Title not available (Why is that?)
- The binary network flow problem is logspace complete for P
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
Cited In (13)
- On the complexity of data disjunctions.
- Complement, complexity, and symmetric representation
- Title not available (Why is that?)
- Languages represented by Boolean formulas
- The complexity of semilinear problems in succinct representation
- The complexity of combinatorial problems with succinct input representation
- Succinct representation, leaf languages, and projection reductions
- Some observations on holographic algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving computational problems in the theory of word-representable graphs
- Succinct representations of graphs
- Representations of graphs and networks (coding, layouts and embeddings)
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)
