Apollonian network

Results: 18



#Item
1ICS 163 — Graph Algorithms — Winter Quarter, 1994 Class Hours: Tue/Thur 3:30AM–4:50AM, CS 253 Instructor: David Eppstein Office: CS 448C Phone: Email:

ICS 163 — Graph Algorithms — Winter Quarter, 1994 Class Hours: Tue/Thur 3:30AM–4:50AM, CS 253 Instructor: David Eppstein Office: CS 448C Phone: Email:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2006-04-27 18:49:38
2CCCG 2011, Toronto ON, August 10–12, 2011  Counting Simple Polygonizations of Planar Point Sets Emo Welzl  ∗

CCCG 2011, Toronto ON, August 10–12, 2011 Counting Simple Polygonizations of Planar Point Sets Emo Welzl ∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:08:47
3CCCG 2011, Toronto ON, August 10–12, 2011  Counting Simple Polygonizations of Planar Point Sets Emo Welzl  ∗

CCCG 2011, Toronto ON, August 10–12, 2011 Counting Simple Polygonizations of Planar Point Sets Emo Welzl ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:08:47
4CCCG 2011, Toronto ON, August 10–12, 2011  Making triangulations 4-connected using flips Prosenjit Bose∗  Dana Jansens∗

CCCG 2011, Toronto ON, August 10–12, 2011 Making triangulations 4-connected using flips Prosenjit Bose∗ Dana Jansens∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
5CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008  On the Complexity of Point Recolouring in Geometric Graphs Henk Meijer Roosevelt Academy Middelburg, The Netherlands

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On the Complexity of Point Recolouring in Geometric Graphs Henk Meijer Roosevelt Academy Middelburg, The Netherlands

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:04:47
6CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014  Planar Graphs with Many Perfect Matchings and Forests∗ Michael Biro†  Abstract

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Planar Graphs with Many Perfect Matchings and Forests∗ Michael Biro† Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-29 21:46:24
7Guaranteed 3.67V bit encoding of planar triangle graphs Davis King Jarek Rossignac  GVU Center

Guaranteed 3.67V bit encoding of planar triangle graphs Davis King Jarek Rossignac GVU Center

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:05:15
8CCCG 2011, Toronto ON, August 10–12, 2011  Making triangulations 4-connected using flips Prosenjit Bose∗  Dana Jansens∗

CCCG 2011, Toronto ON, August 10–12, 2011 Making triangulations 4-connected using flips Prosenjit Bose∗ Dana Jansens∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
9Decomposition and enumeration of planar graphs ´ Eric Fusy Dept. Mathematics, University of British Columbia

Decomposition and enumeration of planar graphs ´ Eric Fusy Dept. Mathematics, University of British Columbia

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2008-12-01 13:59:33
1010 Steps to Counting Unlabeled Planar Graphs: 20 Years Later Manuel Bodirsky October 2007

10 Steps to Counting Unlabeled Planar Graphs: 20 Years Later Manuel Bodirsky October 2007

Add to Reading List

Source URL: algo.inria.fr

Language: English - Date: 2007-10-26 04:28:33