686 search results - page 69 / 138 » Packing Cycles in Graphs |
78
Voted
CHI
2007
ACM
16 years 28 days ago
2007
ACM
How can we keep technology-focused computing and software engineering students interested and engaged in a soft subject like HCI? How can we avoid leaving the less gifted and less...
115
click to vote
JCT
2010
14 years 11 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
121
click to vote
FMCO
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
94
Voted
DM
2010
15 years 19 days ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
117
Voted
IPL
2002
15 years 7 days ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...