Sciweavers

686 search results - page 103 / 138
» Packing Cycles in Graphs
Sort
View
DBA
2004
93views Database» more  DBA 2004»
15 years 2 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
CPC
2002
95views more  CPC 2002»
15 years 14 days ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
124
Voted
TCBB
2011
14 years 7 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
IPPS
2009
IEEE
15 years 7 months ago
Deadlock prevention by turn prohibition in interconnection networks
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
104
Voted
JCT
2010
79views more  JCT 2010»
14 years 11 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender