8 search results - page 2 / 2 » An asymptotic approximation scheme for multigraph edge color... |
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
JCO
2010
13 years 3 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...