6740 search results - page 320 / 1348 » An s -Hamiltonian Line Graph Problem |
157
click to vote
ENDM
2008
15 years 4 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
194
click to vote
STRINGOLOGY
2008
15 years 5 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
162
click to vote
MOBICOM
2012
ACM
13 years 6 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
137
Voted
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
134
Voted
AI
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...