Graphs

Results: 4392



#Item
321

ROCK-PAPER-SCISSORS MEETS BORROMEAN RINGS MARC CHAMBERLAND AND EUGENE A. HERMAN 1. Introduction Directed graphs with an odd number of vertices n, where each vertex has both (n − 1)/2 incoming and outgoing edges, have a

Add to Reading List

Source URL: www.math.grin.edu

- Date: 2014-06-20 10:52:42
    322

    Branchwidth of Graphs boosting approach, applied to them, minimizes the output size. These pages have provided convincing evidence that the Burrows–Wheeler Transform is an elegant and efficient permutation P . Surpris

    Add to Reading List

    Source URL: users.uoa.gr

    - Date: 2014-06-11 17:30:26
      323

      Comparative Study of Search Engine Result Visualisation: Ranked Lists Versus Graphs Casper Petersen Christina Lioma

      Add to Reading List

      Source URL: ceur-ws.org

      - Date: 2013-07-11 17:22:22
        324

        Delft University of Technology Software Engineering Research Group Technical Report Series A Constraint Language for Static Semantic Analysis Based on Scope Graphs

        Add to Reading List

        Source URL: swerl.tudelft.nl

        - Date: 2015-12-18 18:38:35
          325

          Perfect Matchings in Planar Cubic Graphs Maria Chudnovsky1 Columbia University, New York, NYPaul Seymour2 Princeton University, Princeton, NJJanuary 24, 2008; revised July 16, 2009

          Add to Reading List

          Source URL: web.math.princeton.edu

          - Date: 2009-07-21 17:15:14
            326

            Interlacing Eigenvalues and Graphs Willem H. Haemers Tilburg

            Add to Reading List

            Source URL: members.upc.nl

            - Date: 2012-10-03 05:33:39
              327

              SEARCHING FOR A VISIBLE, LAZY FUGITIVE∗ DAVID RICHERBY† AND DIMITRIOS M. THILIKOS‡ Abstract. Graph searching problems are described as games played on graphs, between a set of cops and a fugitive. Variants of the g

              Add to Reading List

              Source URL: users.uoa.gr

              - Date: 2014-06-11 17:30:30
                328

                Journal of Algorithms 32, 167᎐194 Ž1999. Article ID jagm, available online at http:rrwww.idealibrary.com on Graphs with Branchwidth at Most ThreeU Hans L. Bodlaender Department of Computer Science, Utrecht U

                Add to Reading List

                Source URL: users.uoa.gr

                - Date: 2014-06-11 17:30:27
                  329

                  Pathfinder: Visual Analysis of Paths in Graphs Supplementary Material Christian Partl

                  Add to Reading List

                  Source URL: caleydo.gehlenborg.com

                  - Date: 2016-04-12 13:35:11
                    330

                    Andries E. Brouwer, Willem H. Haemers Spectra of graphs – Monograph – February 1, 2011

                    Add to Reading List

                    Source URL: hassan.kharazi.net

                    - Date: 2014-01-17 01:59:22
                      UPDATE