64 research outputs found

    Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings

    Get PDF
    The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and Seymour (Maria Chudnovsky, Alexandra Fradkin, and Paul Seymour, 2012; Maria Chudnovsky, Alex Scott, and Paul Seymour, 2011; Maria Chudnovsky and Paul D. Seymour, 2011; Alexandra Fradkin and Paul Seymour, 2010; Alexandra Fradkin and Paul Seymour, 2011; Ilhee Kim and Paul Seymour, 2012). In this work we introduce a new approach to computing these width measures on semi-complete digraphs, via degree orderings. Using the new technique we are able to reprove the main results of (Maria Chudnovsky, Alexandra Fradkin, and Paul Seymour, 2012; Alexandra Fradkin and Paul Seymour, 2011) in a unified and significantly simplified way, as well as obtain new results. First, we present polynomial-time approximation algorithms for both cutwidth and pathwidth, faster and simpler than the previously known ones; the most significant improvement is in case of pathwidth, where instead of previously known O(OPT)-approximation in fixed-parameter tractable time (Fedor V. Fomin and Michal Pilipczuk, 2013) we obtain a constant-factor approximation in polynomial time. Secondly, by exploiting the new set of obstacles for cutwidth and pathwidth, we show that topological containment and immersion in semi-complete digraphs can be tested in single-exponential fixed-parameter tractable time. Finally, we present how the new approach can be used to obtain exact fixed-parameter tractable algorithms for cutwidth and pathwidth, with single-exponential running time dependency on the optimal width.publishedVersio

    Homomorphism complexes, reconfiguration, and homotopy for directed graphs

    Full text link
    The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also related to mixings of graph colorings and other reconfiguration problems, as well as a notion of discrete homotopy for graphs. Here we initiate the detailed study of Hom complexes for directed graphs (digraphs). For any pair of digraphs graphs GG and HH, we consider the polyhedral complex Hom(G,H)\text{Hom}(G,H) that parametrizes the directed graph homomorphisms f:G→Hf: G \rightarrow H. Hom complexes of digraphs have applications in the study of chains in graded posets and cellular resolutions of monomial ideals. We study examples of directed Hom complexes and relate their topological properties to certain graph operations including products, adjunctions, and foldings. We introduce a notion of a neighborhood complex for a digraph and prove that its homotopy type is recovered as the Hom complex of homomorphisms from a directed edge. We establish a number of results regarding the topology of directed neighborhood complexes, including the dependence on directed bipartite subgraphs, a digraph version of the Mycielski construction, as well as vanishing theorems for higher homology. The Hom complexes of digraphs provide a natural framework for reconfiguration of homomorphisms of digraphs. Inspired by notions of directed graph colorings we study the connectivity of Hom(G,Tn)\text{Hom}(G,T_n) for TnT_n a tournament. Finally, we use paths in the internal hom objects of digraphs to define various notions of homotopy, and discuss connections to the topology of Hom complexes.Comment: 34 pages, 10 figures; V2: some changes in notation, clarified statements and proofs, other corrections and minor revisions incorporating comments from referee

    On a C⃗4\vec{C}_4-ultrahomogeneous oriented graph

    Get PDF
    The notion of a C\mathcal C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and subsequently a strongly connected C⃗4\vec{C}_4-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in which pencils are replaced by ordered pencils.Comment: 4 pages, 2 figures, 2 table

    On width measures and topological problems on semi-complete digraphs

    Get PDF
    Under embargo until: 2021-02-01The topological theory for semi-complete digraphs, pioneered by Chudnovsky, Fradkin, Kim, Scott, and Seymour [10], [11], [12], [28], [43], [39], concentrates on the interplay between the most important width measures β€” cutwidth and pathwidth β€” and containment relations like topological/minor containment or immersion. We propose a new approach to this theory that is based on outdegree orderings and new families of obstacles for cutwidth and pathwidth. Using the new approach we are able to reprove the most important known results in a unified and simplified manner, as well as provide multiple improvements. Notably, we obtain a number of efficient approximation and fixed-parameter tractable algorithms for computing width measures of semi-complete digraphs, as well as fast fixed-parameter tractable algorithms for testing containment relations in the semi-complete setting. As a direct corollary of our work, we also derive explicit and essentially tight bounds on duality relations between width parameters and containment orderings in semi-complete digraphs.acceptedVersio

    Matrices of forests, analysis of networks, and ranking problems

    Get PDF
    The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference relations / sports competitions are considered. It is shown that the vertex accessibility measure based on spanning forests has a number of desirable properties. An interpretation for the stochastic matrix of out-forests in terms of information dissemination is given.Comment: 8 pages. This article draws heavily from arXiv:math/0508171. Published in Proceedings of the First International Conference on Information Technology and Quantitative Management (ITQM 2013). This version contains some corrections and addition
    • …
    corecore