K-edge-connected graph

Results: 14



#Item
1Bachelor / Master Thesis  Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
2Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen  Fan Chung

Drawing Power Law Graphs using a Local/Global Decomposition ∗ Reid Andersen Fan Chung

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2005-02-25 13:23:11
3Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1  2

Excluding Graphs as Immersions in Surface Embedded Graphs Archontia C. Giannopoulou1,?,?? , Marcin Kami´nski2 , and Dimitrios M. Thilikos3? ? ? 1 2

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2013-04-23 04:28:57
4c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2004-03-11 06:32:34
5Tri-edge connectivity augmentation in planar straight line graphs Mashhood Ishaque Marwan Al-Jubeh, Krist´of R´edei, Diane L. Souvaine, and Csaba D. T´oth.

Tri-edge connectivity augmentation in planar straight line graphs Mashhood Ishaque Marwan Al-Jubeh, Krist´of R´edei, Diane L. Souvaine, and Csaba D. T´oth.

Add to Reading List

Source URL: www.eecs.tufts.edu

Language: English - Date: 2009-12-22 11:05:24
6Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗  Mashhood Ishaque∗

Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗ Mashhood Ishaque∗

Add to Reading List

Source URL: www.eecs.tufts.edu

Language: English - Date: 2010-03-17 17:57:11
7

PDF Document

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2014-10-07 11:22:31
8Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1

Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-12-03 01:22:41
9I:/Documents and Settings/Jiang/My Documents/rochester/isc/paper/sk-isc-final.dvi

I:/Documents and Settings/Jiang/My Documents/rochester/isc/paper/sk-isc-final.dvi

Add to Reading List

Source URL: discovery.csc.ncsu.edu

Language: English - Date: 2011-11-09 13:26:10
10Graph Sparsification via Refinement Sampling Ashish Goel∗ Michael Kapralov†  Sanjeev Khanna‡

Graph Sparsification via Refinement Sampling Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50