Sciweavers

601 search results - page 70 / 121
» Edge-dominating cycles in graphs
Sort
View
DAM
1999
132views more  DAM 1999»
13 years 8 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Design of regular (2, dc)-LDPC codes over GF(q) using their binary images
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...
Charly Poulliat, Marc P. C. Fossorier, David Decle...
TAMC
2010
Springer
13 years 7 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
IJAC
2010
96views more  IJAC 2010»
13 years 6 months ago
Coxeter Covers of the Classical Coxeter Groups
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
Meirav Amram, Robert Shwartz, Mina Teicher
INFOCOM
2012
IEEE
11 years 11 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang