86 research outputs found

    Half-integral Erd\H{o}s-P\'osa property of directed odd cycles

    Full text link
    We prove that there exists a function f:NRf:\mathbb{N}\rightarrow \mathbb{R} such that every digraph GG contains either kk directed odd cycles where every vertex of GG is contained in at most two of them, or a vertex set XX of size at most f(k)f(k) hitting all directed odd cycles. This extends the half-integral Erd\H{o}s-P\'osa property of undirected odd cycles, proved by Reed [Mangoes and blueberries. Combinatorica 1999], to digraphs.Comment: 16 pages, 5 figure

    Automatic Layout of Data Flow Diagrams in KIELER and Ptolemy II

    Get PDF
    Data flow diagrams are successfully applied in the area of model-based design of complex embedded systems. However, their creation and maintenance can be very time-consuming, because many tools offer little support for the editing and visualization of graphical models. The KIELER project explores new concepts for the pragmatics of graphical modeling and develops algorithms for automatic layout of specific classes of diagrams. These concepts and algorithms are implemented as extensions of the Eclipse framework, which offers generic approaches to create IDEs for graphical modeling. We have developed a specialized layout algorithm for data flow diagrams. In addition to the embedding in KIELER, we applied this algorithm to Ptolemy, a framework for research on models of computation for use in embedded systems. The results show that our algorithm is well suited for the actor oriented diagrams of Ptolemy, and it can serve as a basis to facilitate the editing of Ptolemy diagrams

    Subject Index Volumes 1–200

    Get PDF

    Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010

    Get PDF
    Peer Reviewe

    EUROCOMB 21 Book of extended abstracts

    Get PDF
    corecore