Login / Signup
Proof of Berge's strong path partition conjecture for k=2.
Eli Berger
Irith Ben-Arroyo Hartman
Published in:
Eur. J. Comb. (2008)
Keyphrases
</>
shortest path
information systems
theorem prover
theorem proving
partitioning algorithm
real time
data sets
databases
information retrieval
learning algorithm
relational databases
endpoints
optimal path
low degree