scientific article; zbMATH DE number 3874609

zbMATH Open0548.68040MaRDI QIDQ3340148FDOQ3340148

Authors: K. W. Wagner 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 219271
• scientific article; zbMATH DE number 3883612
• Succinct representations of graphs
• scientific article; zbMATH DE number 3874610
• The computational complexity of graph problems with succinct multigraph representation

zbMATH Keywords

graph accessibility problemcompact descriptionsgraph colourability problemgraphs with regularities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (18)

• A bound for the complexity of a simple graph
• Satisfiability of Algebraic Circuits over Sets of Natural Numbers
• On the complexity of finite subgraphs of the curve graph
• Title not available (Why is that?)
• The complexity of finite graphs
• Title not available (Why is that?)
• Some computational aspects of solvable regular covers of graphs
• On the complexity of some problems related to graph extensions
• On the weighted complexity of a regular covering of a graph
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic
• The complexity of combinatorial problems with succinct input representation
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• Equivalence problems for circuits over sets of natural numbers
• Title not available (Why is that?)
• Integer circuit evaluation is PSPACE-complete
• Emptiness problems for integer circuits
• Title not available (Why is that?)
• Computing vertex resolvability of some regular planar graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340148)