Simplex graph

Results: 31



#Item
1On Topological Minors in Random Simplicial Complexes∗ Anna Gundert† Uli Wagner‡  arXiv:1404.2106v2 [math.CO] 4 May 2015

On Topological Minors in Random Simplicial Complexes∗ Anna Gundert† Uli Wagner‡ arXiv:1404.2106v2 [math.CO] 4 May 2015

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-05-04 22:06:38
2Unique Sink Orientations of Grids  ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
3121  Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

121 Doc. Math. J. DMV On the Construction of the Kan Loop Group Friedhelm Waldhausen

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2014-07-13 07:29:13
4Geometry and combinatorics of cube complexes Mark F. Hagen Doctor of Philosophy

Geometry and combinatorics of cube complexes Mark F. Hagen Doctor of Philosophy

Add to Reading List

Source URL: www.wescac.net

Language: English - Date: 2014-06-23 02:54:46
5Transactions in GIS, 2007, 11(6): 943– 960  Research Article B Transactions

Transactions in GIS, 2007, 11(6): 943– 960 Research Article B Transactions

Add to Reading List

Source URL: fromto.hig.se

Language: English - Date: 2007-12-20 21:13:19
6GEOMETRIC DATA STRUCTURES  A Dissertation submitted to the department of COMPUTER SCIENCE of Tufts University in partial fulfillment of the requirements

GEOMETRIC DATA STRUCTURES A Dissertation submitted to the department of COMPUTER SCIENCE of Tufts University in partial fulfillment of the requirements

Add to Reading List

Source URL: www.eecs.tufts.edu

Language: English - Date: 2010-09-14 03:28:28
7On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Add to Reading List

Source URL: www.cs.rpi.edu

Language: English - Date: 2011-07-18 11:44:43
8An Almost Optimal Algorithm for Dynamically Updating the Reeb Graph Salman Parsa ∗ This work is about an efficient algorithm for dynamic updates of the Reeb graph. Given a simplicial complex K and a simplex-wise linear

An Almost Optimal Algorithm for Dynamically Updating the Reeb Graph Salman Parsa ∗ This work is about an efficient algorithm for dynamic updates of the Reeb graph. Given a simplicial complex K and a simplex-wise linear

Add to Reading List

Source URL: fwcg14.cse.uconn.edu

Language: English - Date: 2014-10-29 21:34:13
    9A SSIGNMENT 1  C OURSE : CPS530 Problem 1: A network problem is formulated for a directed graph G = (V, E) using the node-arc incidence matrix, as in the shortest-path problem discussed in the class. Show that a set of |

    A SSIGNMENT 1 C OURSE : CPS530 Problem 1: A network problem is formulated for a directed graph G = (V, E) using the node-arc incidence matrix, as in the shortest-path problem discussed in the class. Show that a set of |

    Add to Reading List

    Source URL: www.cs.duke.edu

    Language: English - Date: 2012-09-20 15:07:08
    10CCCG 2004, Montreal, Quebec, August 9–11, 2004  Surface Reconstruction, One Triangle at a Time Daniel Freedman  

    CCCG 2004, Montreal, Quebec, August 9–11, 2004 Surface Reconstruction, One Triangle at a Time Daniel Freedman 

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2004-08-23 15:27:23