On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs.

Serafino Cicerone Gabriele Di Stefano

Published in: ISAAC (1997)

Keyphrases

decision problems
bipartite graph
graph model
problems involving
np complete
benchmark problems
graph structure
solving problems
evolutionary algorithm
computational cost
optimization problems
graph theoretic
subgraph isomorphism
polynomial time complexity