Vertex

Results: 1582



#Item
51Proof, beliefs, and algorithms through the lens of sum-of-squares  1 Cheeger’s inequality Let G be a d-regular graph with vertex set V = [n]. For a vertex

Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Cheeger’s inequality Let G be a d-regular graph with vertex set V = [n]. For a vertex

Add to Reading List

Source URL: sumofsquares.org

- Date: 2016-11-17 19:44:26
    52ROCK-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

    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
      53Finding 2-edge and 2-vertex strongly connected components in quadratic time Monika Henzinger Sebastian Krinninger

      Finding 2-edge and 2-vertex strongly connected components in quadratic time Monika Henzinger Sebastian Krinninger

      Add to Reading List

      Source URL: eprints.cs.univie.ac.at

      - Date: 2015-11-02 05:45:22
        54Where’s	Poly?  What	do	you	notice? Each	dot	is	a	vertex.	 What	do	you	notice?

        Where’s Poly? What do you notice? Each dot is a vertex. What do you notice?

        Add to Reading List

        Source URL: gfletchy.files.wordpress.com

        - Date: 2016-12-05 13:25:03
          55Theory Comput Syst DOIs00224A Note on Exact Algorithms for Vertex Ordering Problems on Graphs Hans L. Bodlaender · Fedor V. Fomin ·

          Theory Comput Syst DOIs00224A Note on Exact Algorithms for Vertex Ordering Problems on Graphs Hans L. Bodlaender · Fedor V. Fomin ·

          Add to Reading List

          Source URL: users.uoa.gr

          - Date: 2014-06-11 17:30:32
            56An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

            An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

            Add to Reading List

            Source URL: theoryofcomputing.org

            - Date: 2014-11-14 13:01:31
              57Complexity Issues in Vertex-Colored Graph Pattern MatchingI,II Riccardo Dondia , Guillaume Fertinb , St´ephane Vialettec a Dipartimento  di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

              Complexity Issues in Vertex-Colored Graph Pattern MatchingI,II Riccardo Dondia , Guillaume Fertinb , St´ephane Vialettec a Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali

              Add to Reading List

              Source URL: pagesperso.lina.univ-nantes.fr

              - Date: 2011-04-27 05:28:57
                58Dynamical Vertex Approximation

                Dynamical Vertex Approximation

                Add to Reading List

                Source URL: www.cond-mat.de

                - Date: 2014-09-03 06:19:52
                  59Algorithms and Data Structures Winter TermExercises for UnitExplicitly representing the shortest paths between all n2 vertex pairs of an n-vertex graph may take space up to Θ(n3 ) (since Θ(n2 ) of those

                  Algorithms and Data Structures Winter TermExercises for UnitExplicitly representing the shortest paths between all n2 vertex pairs of an n-vertex graph may take space up to Θ(n3 ) (since Θ(n2 ) of those

                  Add to Reading List

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

                  - Date: 2016-03-16 06:50:44
                    60

                    PDF Document

                    Add to Reading List

                    Source URL: vertex.spb.ru

                    - Date: 2016-07-29 10:58:46