Výsledky vyhľadávania - "optimal-time algorithm"

The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs: The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs

Autori: Rahnuma Islam Nishat Venkatesh Srinivasan Sue Whitesides

Zdroj: Lecture Notes in Computer Science ISBN: 9783031221040

Predmety: FOS: Computer and information sciences, Eulerian and Hamiltonian graphs, simple paths, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Programming involving graphs or networks, 01 natural sciences, optimal-time algorithm, Graph theory (including graph drawing) in computer science, rectangular grid graphs, lower bound, solution-space graph, reconfiguration algorithm, Hamiltonian paths, Computer Science - Discrete Mathematics

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2205.08025