Graphs

Results: 4392



#Item
31

Lossy Compression of Dynamic, Weighted Graphs Wilko Henecka and Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ UoA

Add to Reading List

Source URL: www.maths.adelaide.edu.au

Language: English - Date: 2017-04-06 22:23:22
    32

    Uniqueness of Invariant Lagrangian Graphs in a Homology or a Cohomology Class. Albert Fathi, Alessandro Giuliani and Alfonso Sorrentino March 6, 2009 Given a smooth compact Riemannian manifold M and a Hamiltonian H on th

    Add to Reading List

    Source URL: www.mat.uniroma2.it

    Language: English - Date: 2015-09-01 05:49:41
      33

      Coloring graphs with two odd cycle lengths Jie Ma∗ Bo Ning† arXiv:1512.06393v1 [math.CO] 20 Dec 2015

      Add to Reading List

      Source URL: staff.ustc.edu.cn

      Language: English - Date: 2016-01-17 09:35:14
        34

        Percolation and Random Walks on Graphs, MichaelmasExample Sheet 2 1. Let R(r) be the effective resistance between two given vertices of a finite network with

        Add to Reading List

        Source URL: www.statslab.cam.ac.uk

        Language: English - Date: 2017-11-29 11:46:56
          35

          3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen

          Add to Reading List

          Source URL: www.graphs.ee

          Language: English - Date: 2014-10-29 13:30:24
            36

            Classroom Voting Questions: Precalculus Trigonometric Functions: Amplitudes, Periods, and Graphs 1. Which of the following is the approximate value for the sine and cosine of angles A and B in the figure below.

            Add to Reading List

            Source URL: mathquest.carroll.edu

            Language: English - Date: 2018-05-02 10:39:51
              37

              Keith M Jones* (), Department of Mathematics, CS & Stats, SUNY Oneonta, 108 Ravine Parkway, Oneonta, NYVisual Boundaries for Diestel-Leader Graphs. One standard way to constru

              Add to Reading List

              Source URL: jointmathematicsmeetings.org

              - Date: 2013-09-18 02:37:05
                38

                A Linear Lower Bound on the Query Complexity of Property Testing Algorithms for 3-Coloring in Bounded-degree Graphs Andrej Bogdanov∗ Kenji Obata†

                Add to Reading List

                Source URL: www.cse.cuhk.edu.hk

                Language: English - Date: 2008-09-12 03:56:18
                  39

                  Accumulation Games on Graphs LSE-CDAMSteve Alpern1,2 and Robbert Fokkink2 1

                  Add to Reading List

                  Source URL: www.cdam.lse.ac.uk

                  Language: English - Date: 2017-04-12 10:30:40
                    40

                    Program Outcomes The following data were collected from the Spring 2016 PEP Semester. The graphs below are from five courses: Academic Orientation, Career Development, Forgiveness & Healing, Yoga & Meditation, and Art.

                    Add to Reading List

                    Source URL: www.prisoneducationproject.org

                    Language: English - Date: 2016-08-07 19:55:15
                      UPDATE