Sciweavers

124 search results - page 3 / 25
» Undirected Graphs of Entanglement Two
Sort
View
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
11 years 8 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
DSD
2003
IEEE
100views Hardware» more  DSD 2003»
13 years 11 months ago
Fast Heuristics for the Edge Coloring of Large Graphs
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 11 days ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 6 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 7 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál