The computational complexity of graph problems with succinct multigraph representation

This publication has 8 references indexed in Scilit:

• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• The matching problem for bipartite graphs with polynomially bounded permanents is in NC
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Matching is as easy as matrix inversion
  Published by Association for Computing Machinery (ACM) ,1987
• A note on succinct representations of graphs
  Information and Control, 1986
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Constructing a perfect matching is in random NC
  Published by Association for Computing Machinery (ACM) ,1985
• Succinct representations of graphs
  Information and Control, 1983
• The complexity of compacting hierarchically specified layouts of integrated circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982