65 search results - page 5 / 13 » On approximating the maximum diameter ratio of graphs |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
WABI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
CCCG
2009
13 years 8 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...