Sciweavers

432 search results - page 26 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
STACS
2005
Springer
14 years 1 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Telikepalli Kavitha, Kurt Mehlhorn
JGAA
2006
72views more  JGAA 2006»
13 years 7 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
DCC
2007
IEEE
14 years 7 months ago
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
Jon-Lark Kim, Keith E. Mellinger, Leo Storme
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
14 years 1 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen