Moore graph

Results: 12



#Item
1Moore 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
    2Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh Department of Computer Science Texas A&M University College Station,

    Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh Department of Computer Science Texas A&M University College Station,

    Add to Reading List

    Source URL: conferences.sigcomm.org

    Language: English - Date: 2003-07-24 11:26:27
    3Hierarchical structure and the prediction of missing links in networks Aaron Clauset,1,3 Cristopher Moore,1,2,3 M. E. J. Newman3,4∗ 1  Department of Computer Science and 2 Department of Physics and Astronomy,

    Hierarchical structure and the prediction of missing links in networks Aaron Clauset,1,3 Cristopher Moore,1,2,3 M. E. J. Newman3,4∗ 1 Department of Computer Science and 2 Department of Physics and Astronomy,

    Add to Reading List

    Source URL: snap.stanford.edu

    Language: English - Date: 2011-12-06 15:12:26
    49780199233212_Moore_&_Mertens.pdf

    9780199233212_Moore_&_Mertens.pdf

    Add to Reading List

    Source URL: fdslive.oup.com

    Language: English - Date: 2013-09-30 10:01:30
    5Scalable Detection of Statistically Significant Communities and Hierarchies: Message-Passing for Modularity Pan Zhang Cris Moore

    Scalable Detection of Statistically Significant Communities and Hierarchies: Message-Passing for Modularity Pan Zhang Cris Moore

    Add to Reading List

    Source URL: www.santafe.edu

    Language: English - Date: 2014-04-02 18:39:12
    6Robust Distributed Network Localization with Noisy Range Measurements David Moore John Leonard Daniela Rus Seth Teller MIT Computer Science and Artificial Intelligence Laboratory The Stata Center, 32 Vassar Street Cambri

    Robust Distributed Network Localization with Noisy Range Measurements David Moore John Leonard Daniela Rus Seth Teller MIT Computer Science and Artificial Intelligence Laboratory The Stata Center, 32 Vassar Street Cambri

    Add to Reading List

    Source URL: rvsn.csail.mit.edu

    Language: English - Date: 2006-03-01 10:59:21
    7Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries Jeremy Kubica JKUBICA @ RI . CMU . EDU Andrew Moore

    Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries Jeremy Kubica JKUBICA @ RI . CMU . EDU Andrew Moore

    Add to Reading List

    Source URL: www.cs.cmu.edu

    Language: English - Date: 2003-06-17 12:33:54
    8TRANSVERSE MERCATOR PROJECTIONS AND U.S. GEOLOGICAL SURVEY DIGITAL PRODUCTS Larry Moore U.S. Geological Survey  ABSTRACT

    TRANSVERSE MERCATOR PROJECTIONS AND U.S. GEOLOGICAL SURVEY DIGITAL PRODUCTS Larry Moore U.S. Geological Survey ABSTRACT

    Add to Reading List

    Source URL: thor-f5.er.usgs.gov

    Language: English - Date: 2003-08-14 16:26:26
    9The Hunt for a Quantum Algorithm for Graph Isomorphism Cristopher Moore, University of New Mexico Alexander Russell, University of Connecticut Leonard J. Schulman, Caltech

    The Hunt for a Quantum Algorithm for Graph Isomorphism Cristopher Moore, University of New Mexico Alexander Russell, University of Connecticut Leonard J. Schulman, Caltech

    Add to Reading List

    Source URL: tuvalu.santafe.edu

    Language: English - Date: 2006-01-21 16:46:17
    10Graphs of Groups: Word Computations and Free Crossed Resolutions Emma Jane Moore November 2000  Summary

    Graphs of Groups: Word Computations and Free Crossed Resolutions Emma Jane Moore November 2000 Summary

    Add to Reading List

    Source URL: pages.bangor.ac.uk

    Language: English - Date: 2008-03-17 08:32:10