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...
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...
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...
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. ...
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...