33,971 research outputs found

    Non-Convex Representations of Graphs

    Get PDF
    We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygon

    HARP: Hierarchical Representation Learning for Networks

    Full text link
    We present HARP, a novel method for learning low dimensional embeddings of a graph's nodes which preserves higher-order structural features. Our proposed method achieves this by compressing the input graph prior to embedding it, effectively avoiding troublesome embedding configurations (i.e. local minima) which can pose problems to non-convex optimization. HARP works by finding a smaller graph which approximates the global structure of its input. This simplified graph is used to learn a set of initial representations, which serve as good initializations for learning representations in the original, detailed graph. We inductively extend this idea, by decomposing a graph in a series of levels, and then embed the hierarchy of graphs from the coarsest one to the original graph. HARP is a general meta-strategy to improve all of the state-of-the-art neural algorithms for embedding graphs, including DeepWalk, LINE, and Node2vec. Indeed, we demonstrate that applying HARP's hierarchical paradigm yields improved implementations for all three of these methods, as evaluated on both classification tasks on real-world graphs such as DBLP, BlogCatalog, CiteSeer, and Arxiv, where we achieve a performance gain over the original implementations by up to 14% Macro F1.Comment: To appear in AAAI 201

    Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space

    Get PDF
    We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where `canonical' means that models of isomorphic graphs are equal. This implies that the recognition and the isomorphism problems for this class of graphs are solvable in logspace. For a broader class of concave-round graphs, that still possess (not necessarily proper) circular-arc models, we show that those can also be constructed canonically in logspace. As a building block for these results, we show how to compute canonical models of circular-arc hypergraphs in logspace, which are also known as matrices with the circular-ones property. Finally, we consider the search version of the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We solve it in logspace for the classes of proper circular-arc, concave-round, and co-convex graphs.Comment: 19 pages, 3 figures, major revisio

    Graphs with Plane Outside-Obstacle Representations

    Full text link
    An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations are a recent generalization of classical polygon--vertex visibility graphs, for which the characterization and recognition problems are long-standing open questions. In this paper, we study \emph{plane outside-obstacle representations}, where all obstacles lie in the unbounded face of the representation and no two visibility segments cross. We give a combinatorial characterization of the biconnected graphs that admit such a representation. Based on this characterization, we present a simple linear-time recognition algorithm for these graphs. As a side result, we show that the plane vertex--polygon visibility graphs are exactly the maximal outerplanar graphs and that every chordal outerplanar graph has an outside-obstacle representation.Comment: 12 pages, 7 figure

    Orthogonal Graph Drawing with Inflexible Edges

    Full text link
    We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge. More precisely, we have a flexibility function assigning to each edge ee a natural number flex(e)\mathrm{flex}(e), its flexibility. The problem FlexDraw asks whether there exists an orthogonal drawing such that each edge ee has at most flex(e)\mathrm{flex}(e) bends. It is known that FlexDraw is NP-hard if flex(e)=0\mathrm{flex}(e) = 0 for every edge ee. On the other hand, FlexDraw can be solved efficiently if flex(e)≥1\mathrm{flex}(e) \ge 1 and is trivial if flex(e)≥2\mathrm{flex}(e) \ge 2 for every edge ee. To close the gap between the NP-hardness for flex(e)=0\mathrm{flex}(e) = 0 and the efficient algorithm for flex(e)≥1\mathrm{flex}(e) \ge 1, we investigate the computational complexity of FlexDraw in case only few edges are inflexible (i.e., have flexibility~00). We show that for any ε>0\varepsilon > 0 FlexDraw is NP-complete for instances with O(nε)O(n^\varepsilon) inflexible edges with pairwise distance Ω(n1−ε)\Omega(n^{1-\varepsilon}) (including the case where they induce a matching). On the other hand, we give an FPT-algorithm with running time O(2k⋅n⋅Tflow(n))O(2^k\cdot n \cdot T_{\mathrm{flow}}(n)), where Tflow(n)T_{\mathrm{flow}}(n) is the time necessary to compute a maximum flow in a planar flow network with multiple sources and sinks, and kk is the number of inflexible edges having at least one endpoint of degree 4.Comment: 23 pages, 5 figure
    • …
    corecore