Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach.

Stéphane Bessy

Published in: Discret. Math. (2008)

Keyphrases

strictly convex
sufficient conditions
optimal path
equivalence classes
path finding
database
neural network
genetic algorithm
shortest path
directed graph
markov models
partitioning algorithm
information systems
search algorithm
traveling salesman problem