Two-graph

Results: 168



#Item
1Intelligent Graph Layout Using Many Users’ Input Xiaoru Yuan, Member, IEEE, Limei Che, Yifan Hu and Xin Zhang Fig. 1. Two layouts that combine many users’ input sub-graphs using our Laplacian Constrained Distance Emb

Intelligent Graph Layout Using Many Users’ Input Xiaoru Yuan, Member, IEEE, Limei Che, Yifan Hu and Xin Zhang Fig. 1. Two layouts that combine many users’ input sub-graphs using our Laplacian Constrained Distance Emb

Add to Reading List

Source URL: yifanhu.net

Language: English - Date: 2012-08-23 20:46:41
    2Pursuit evasion on infinite graphs Florian Lehner∗ January 11, 2016 The cop-and-robber game is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known

    Pursuit evasion on infinite graphs Florian Lehner∗ January 11, 2016 The cop-and-robber game is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known

    Add to Reading List

    Source URL: www.florian-lehner.net

    Language: English - Date: 2016-05-09 12:35:41
      3SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

      SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin

      Add to Reading List

      Source URL: www.math.ucdavis.edu

      - Date: 2014-02-10 20:43:55
        4GLOBAL STRUCTURAL PROPERTIES OF RANDOM GRAPHS JASON BEHRSTOCK, VICTOR FALGAS-RAVRY, MARK F. HAGEN, AND TIM SUSSE Abstract. We study two global structural properties of a graph Γ, denoted AS and CFS, which arise in a nat

        GLOBAL STRUCTURAL PROPERTIES OF RANDOM GRAPHS JASON BEHRSTOCK, VICTOR FALGAS-RAVRY, MARK F. HAGEN, AND TIM SUSSE Abstract. We study two global structural properties of a graph Γ, denoted AS and CFS, which arise in a nat

        Add to Reading List

        Source URL: www.wescac.net

        - Date: 2016-03-02 05:22:35
          5Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

          Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

          Add to Reading List

          Source URL: www-tcs.cs.uni-sb.de

          - Date: 2016-03-20 15:51:33
            6TOPOLOGICAL PRINCIPLES IN CARTOGRAPHY James P. Corbett ABSTRACT CHARACTER OF A MAP A map may be described as a linear graph embedded in a orientable, two-dimen sional manifold. A manifold, aside from being a two-dimensio

            TOPOLOGICAL PRINCIPLES IN CARTOGRAPHY James P. Corbett ABSTRACT CHARACTER OF A MAP A map may be described as a linear graph embedded in a orientable, two-dimen sional manifold. A manifold, aside from being a two-dimensio

            Add to Reading List

            Source URL: mapcontext.com

            - Date: 2008-08-29 22:59:39
              7Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a

              Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a

              Add to Reading List

              Source URL: peterwonka.net

              Language: English - Date: 2013-06-17 17:23:15
              8Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

              Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

              Add to Reading List

              Source URL: page.math.tu-berlin.de

              Language: English
              9In this talk, I will discuss Ligra, a shared-memory graph processing framework that has two very simple routines, one for mapping over edges and one for mapping over vertices. The routines can be applied to any subset of

              In this talk, I will discuss Ligra, a shared-memory graph processing framework that has two very simple routines, one for mapping over edges and one for mapping over vertices. The routines can be applied to any subset of

              Add to Reading List

              Source URL: mmds-data.org

              - Date: 2016-06-23 15:50:48
                10Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

                Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

                Add to Reading List

                Source URL: www-tcs.cs.uni-sb.de

                Language: English - Date: 2016-03-17 15:32:23