On the distributed decision-making complexity of the minimum vertex cover problem
Pierluigi Crescenzi, Luca Trevisan (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The Hamilton circuit problem on grids”
On the distributed decision-making complexity of the minimum vertex cover problem
A new algorithm for finding minimal cycle-breaking sets of turns in a graph.
Levitin, Lev, Karpovsky, Mark, Mustafa, Mehmet, Zakrevski, Lev (2006)
Journal of Graph Algorithms and Applications
Similarity:
Hamilton decompositions and -factorizations of hypercubes.
Bass, Douglas W., Sudborough, I.Hal (2003)
Journal of Graph Algorithms and Applications
Similarity:
TimGA: A genetic algorithm for drawing undirected graphs.
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
Similarity:
A framework for the static and interactive visualization of statecharts.
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On some path problems on oriented hypergraphs
S. Nguyen, D. Pretolani, L. Markenzon (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A partially persistent data structure for the set-union problem
C. Gaibisso, G. Gambosi, M. Talamo (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: