3415 search results - page 581 / 683 » Lower Bounds for Kernelizations |
154
click to vote
NETWORKS
2006
15 years 3 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
122
click to vote
PAMI
2006
15 years 3 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
161
click to vote
IJAHUC
2007
15 years 3 months ago
2007
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
127
click to vote
SIAMDM
2008
15 years 3 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
123
click to vote
SIAMDM
2008
15 years 3 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...