Login / Signup
Two classes of graphs in which some problems related to convexity are efficiently solvable.
Marina Moscarini
Francesco M. Malvestuto
Published in:
Discret. Math. Algorithms Appl. (2018)
Keyphrases
</>
np complete
special case
application domains
problems involving
search algorithm
graph matching
graph structure
multi class
optimization problems
graph representation
computational geometry
multi class problems
finding the shortest path