Login / Signup
NP-completeness results for some problems on subclasses of bipartite and chordal graphs.
Katerina Asdre
Stavros D. Nikolopoulos
Published in:
Theor. Comput. Sci. (2007)
Keyphrases
</>
bipartite graph
application domains
combinatorial optimization
benchmark problems
problems involving
data sets
neural network
data mining
search space
np complete
weighted graph
graph databases
undirected graph
complex structures
solving problems