6740 search results - page 100 / 1348 » An s -Hamiltonian Line Graph Problem |
WEA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
MP
1998
13 years 9 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
GG
2008
Springer
13 years 11 months ago
2008
Springer
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
LICS
2012
IEEE
12 years 16 days ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...