Sciweavers

686 search results - page 86 / 138
» Packing Cycles in Graphs
Sort
View
114
Voted
TCOM
2011
170views more  TCOM 2011»
14 years 7 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
94
Voted
ASWEC
2000
IEEE
15 years 5 months ago
ReVis: Reverse Engineering by Clustering and Visual Object Classification
This paper presents the framework of a scale-oriented scheme for the presentation and classification of reverse engineered sections of procedural code into objects. The aim is to ...
Aaron J. Quigley, Margot Postema, Heinz W. Schmidt
96
Voted
DAM
2008
78views more  DAM 2008»
15 years 21 days ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
98
Voted
GC
2006
Springer
15 years 19 days ago
On n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
Gregory Gutin, Arash Rafiey, Anders Yeo
DM
2008
115views more  DM 2008»
15 years 5 days ago
Characterizations of postman sets
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
Néstor E. Aguilera, Valeria A. Leoni