Recognizing near-bipartite Pfaffian graphs in polynomial time.
Alberto Alexandre Assis MirandaCláudio Leonardo LucchesiPublished in: Discret. Appl. Math. (2010)
Keyphrases
- bipartite graph
- graph model
- graph isomorphism
- planar graphs
- graph partitioning
- polynomial time complexity
- undirected graph
- bounded treewidth
- graph matching
- graph theoretic
- approximation algorithms
- np complete
- graph representation
- special case
- automatic recognition
- series parallel
- vertex set
- graph theory
- neural network
- real valued
- image segmentation
- social networks
- directed graph
- approximation ratio
- subgraph isomorphism
- clustering method
- worst case
- computational complexity
- objective function