2314 search results - page 233 / 463 » Minimal Partitions of a Graph |
130
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
142
click to vote
MST
2010
14 years 11 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
135
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
168
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
133
click to vote
NETWORK
2010
14 years 11 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...