Sciweavers

1963 search results - page 51 / 393
» The Maximum Solution Problem on Graphs
Sort
View
SIAMIS
2010
167views more  SIAMIS 2010»
13 years 3 months ago
Global Solutions of Variational Models with Convex Regularization
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
WG
2004
Springer
14 years 2 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
PPL
2000
91views more  PPL 2000»
13 years 8 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 8 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
13 years 7 months ago
Improved Orientations of Physical Networks
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...
Iftah Gamzu, Danny Segev, Roded Sharan