12 search results - page 1 / 3 » A simple algorithm that proves half-integrality of bidirecte... |
NETWORKS
2006
13 years 4 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
TOPLAS
2010
13 years 3 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...