Sciweavers

177 search results - page 22 / 36
» arc 2008
Sort
View
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...
GC
2008
Springer
13 years 7 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
FSTTCS
2008
Springer
13 years 8 months ago
Analyzing Asynchronous Programs with Preemption
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Toui...
MICCAI
2008
Springer
14 years 8 months ago
Conformal Slit Mapping and Its Applications to Brain Surface Parameterization
We propose a method that computes a conformal mapping from a multiply connected mesh to the so-called slit domain, which consists of a canonical rectangle or disk in which 3D curve...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. ...
ISBI
2008
IEEE
14 years 8 months ago
Brain surface conformal parameterization with the slit mapping
Brain surface conformal mapping has been studied intensively. In this paper, we propose a method that computes a conformal mapping from a multiply connected mesh to the so-called ...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. Tho...