Sciweavers

140 search results - page 5 / 28
» Maximum Series-Parallel Subgraph
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 4 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
JGT
2007
130views more  JGT 2007»
13 years 9 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
GLOBECOM
2008
IEEE
13 years 10 months ago
Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
Vahid Shah-Mansouri, Vincent W. S. Wong
MSN
2007
Springer
14 years 4 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...