2503 search results - page 236 / 501 » A study of 3-arc graphs |
164
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
171
click to vote
NETWORK
2010
15 years 1 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
182
click to vote
WG
1994
Springer
15 years 10 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
182
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
183
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...