686 search results - page 57 / 138 » Packing Cycles in Graphs |
132
Voted
ATMOS
2007
15 years 4 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
124
click to vote
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
100
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we study non-binary regular LDPC cycle codes whose parity check matrix has fixed column weight 2 and fixed row weight d. We prove that the parity check matrix of ...
100
click to vote
DISOPT
2008
15 years 3 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
116
click to vote
SCAM
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...