Two-graph

Results: 168



#Item
11OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
12PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2015-03-23 10:06:06
13The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 11:14:05
14Spectral Graph Theory  Lecture 4 Bounding Eigenvalues Daniel A. Spielman

Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-09-22 14:35:18
15Box and Whisker Graphs The setting of Statplot in the PLOT SETUP view of the Statistics aplet controls what type of graph is drawn. The two choices are Hist (short for histogram) or BoxW (Box and Whisker). Pressing the k

Box and Whisker Graphs The setting of Statplot in the PLOT SETUP view of the Statistics aplet controls what type of graph is drawn. The two choices are Hist (short for histogram) or BoxW (Box and Whisker). Pressing the k

Add to Reading List

Source URL: www.hphomeview.com

Language: English
16Spectral Graph Theory and its Applications  Lecture 12 Algebraic Graphs Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications Lecture 12 Algebraic Graphs Lecturer: Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-06-30 12:02:48
17arXiv:1201.0118v1 [math.SP] 30 DecSpectral Analysis of Certain Spherically Homogeneous Graphs Jonathan Breuer∗ and Matthias Keller†

arXiv:1201.0118v1 [math.SP] 30 DecSpectral Analysis of Certain Spherically Homogeneous Graphs Jonathan Breuer∗ and Matthias Keller†

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-01-03 21:01:04
18591  Documenta Math. Calculation of Rozansky-Witten Invariants on the Hilbert Schemes of Points on a K3 Surface

591 Documenta Math. Calculation of Rozansky-Witten Invariants on the Hilbert Schemes of Points on a K3 Surface

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2004-01-25 11:59:20
19Fine structure of 4-critical triangle-free graphs I. Planar graphs with two triangles and 3-colorability of chains Zdenˇek Dvoˇra´k∗  Bernard Lidick´

Fine structure of 4-critical triangle-free graphs I. Planar graphs with two triangles and 3-colorability of chains Zdenˇek Dvoˇra´k∗ Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-05-27 17:02:42
20Sets that are connected in two random graphs Michael Molloy∗ August 17, 2012 Abstract We consider two random graphs G1 , G2 , both on the same vertex set. We ask whether there

Sets that are connected in two random graphs Michael Molloy∗ August 17, 2012 Abstract We consider two random graphs G1 , G2 , both on the same vertex set. We ask whether there

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-08-17 11:21:38