Complete graph

Results: 868



#Item
1CHARACTERIZING A VERTEX-TRANSITIVE GRAPH BY A LARGE BALL MIKAEL DE LA SALLE AND ROMAIN TESSERA, WITH AN APPENDIX BY JEAN-CLAUDE SIKORAV Abstract. It is well-known that a complete Riemannian manifold M which is locally is

CHARACTERIZING A VERTEX-TRANSITIVE GRAPH BY A LARGE BALL MIKAEL DE LA SALLE AND ROMAIN TESSERA, WITH AN APPENDIX BY JEAN-CLAUDE SIKORAV Abstract. It is well-known that a complete Riemannian manifold M which is locally is

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-12-08 04:58:57
2Enumeration September 17, How many ways can you colour the complete graph with n colours? 2. How many compositions of n are there? 3. How many compositions of n into k parts? 4. How many weak compositions into k

Enumeration September 17, How many ways can you colour the complete graph with n colours? 2. How many compositions of n are there? 3. How many compositions of n into k parts? 4. How many weak compositions into k

Add to Reading List

Source URL: math.colorado.edu

- Date: 2015-12-04 19:21:55
    3Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

    Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

    Add to Reading List

    Source URL: mug.mvapich.cse.ohio-state.edu

    Language: English - Date: 2015-11-20 13:17:47
    4Induced paths of given parity in planar graphs  Naomi Nishimura University of Waterloo Canada

    Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

    Add to Reading List

    Source URL: rutcor.rutgers.edu

    Language: English - Date: 2012-01-04 04:27:26
    5A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin  DIAMANT Symposium – November 2012

    A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

    Add to Reading List

    Source URL: www.daviddelaat.nl

    Language: English
    6Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald  Roger Wattenhofer

    Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

    Add to Reading List

    Source URL: disco.ethz.ch

    Language: English - Date: 2014-09-26 08:36:25
    7A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

    A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

    Add to Reading List

    Source URL: eda.mmci.uni-saarland.de

    Language: English - Date: 2014-10-01 09:01:01
    8TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

    TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

    Add to Reading List

    Source URL: www.ads.tuwien.ac.at

    Language: English - Date: 2015-02-11 08:09:39
    9New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

    New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

    Add to Reading List

    Source URL: community.dur.ac.uk

    Language: English - Date: 2015-03-12 21:45:21