Girth

Results: 114



#Item
1Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner Michael Dinitz ∗

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner Michael Dinitz ∗

Add to Reading List

Source URL: crab.rutgers.edu

Language: English - Date: 2015-11-09 18:21:59
    2Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

    Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

    Add to Reading List

    Source URL: www.cs.haifa.ac.il

    Language: English - Date: 2009-07-12 11:14:50
      3Independent dominating sets in graphs of girth five Ararat Harutyunyan∗ Paul Horn†

      Independent dominating sets in graphs of girth five Ararat Harutyunyan∗ Paul Horn†

      Add to Reading List

      Source URL: web.cs.du.edu

      - Date: 2010-11-16 11:14:30
        4

        PDF Document

        Add to Reading List

        Source URL: www.colesnurseries.co.uk

        Language: English - Date: 2016-01-06 06:02:17
        5Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

        Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

        Add to Reading List

        Source URL: sharif.ir

        Language: English - Date: 2016-01-25 15:19:56
        6Microsoft Word - 13 OH Consignment Items List -1 page

        Microsoft Word - 13 OH Consignment Items List -1 page

        Add to Reading List

        Source URL: equineaffaire.com

        Language: English - Date: 2013-12-03 16:19:42
        7Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1

        Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1

        Add to Reading List

        Source URL: discretemath.imp.fu-berlin.de

        Language: English - Date: 2015-05-31 09:10:32
          8Coloring, sparseness, and girth Noga Alon∗ Alexandr Kostochka† Benjamin Reiniger‡ Douglas B. West§

          Coloring, sparseness, and girth Noga Alon∗ Alexandr Kostochka† Benjamin Reiniger‡ Douglas B. West§

          Add to Reading List

          Source URL: www.tau.ac.il

          Language: English - Date: 2015-04-27 10:57:09
            9Greedy Learning of Graphical Models with Small Girth Avik Ray, Sujay Sanghavi and Sanjay Shakkottai Abstract— This paper develops two new greedy algorithms for learning the Markov graph of discrete probability distribu

            Greedy Learning of Graphical Models with Small Girth Avik Ray, Sujay Sanghavi and Sanjay Shakkottai Abstract— This paper develops two new greedy algorithms for learning the Markov graph of discrete probability distribu

            Add to Reading List

            Source URL: users.ece.utexas.edu

            Language: English - Date: 2012-10-26 11:01:12
              10Equitable colourings of graphs with bounded density and given girth∗ Jean-S´ebastien Sereni† We study the equitable chromatic number of graphs of minimum degree at least 2, lower-bounded girth and upper-bounded dens

              Equitable colourings of graphs with bounded density and given girth∗ Jean-S´ebastien Sereni† We study the equitable chromatic number of graphs of minimum degree at least 2, lower-bounded girth and upper-bounded dens

              Add to Reading List

              Source URL: iti.mff.cuni.cz

              Language: English - Date: 2016-02-04 05:53:37