Sciweavers

1857 search results - page 10 / 372

» Minimum Degree Orderings

23

ISAAC
2009
Springer

133views Algorithms» more ISAAC 2009»

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

14 years 4 months ago

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

Download i11www.iti.uni-karlsruhe.de

Robert Franke, Ignaz Rutter, Dorothea Wagner

claim paper

Read More »

26

IPPS
2003
IEEE

115views Distributed And Parallel Com...» more IPPS 2003»

The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs

14 years 2 months ago

The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs

Download www.ibisc.univ-evry.fr

Lélia Blin, Franck Butelle

claim paper

Read More »

25

STOC
2000
ACM

77views Algorithms» more STOC 2000»

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

14 years 2 months ago

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

Download www.math.uwaterloo.ca

Jochen Könemann, R. Ravi

claim paper

Read More »

25

COMBINATORICS
2007

74views more COMBINATORICS 2007»

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree

13 years 9 months ago

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree

Download www3.combinatorics.org

Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...

Béla Csaba

claim paper

Read More »

25

GC
2010
Springer

110views Applied Computing» more GC 2010»

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs

13 years 8 months ago

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs

Download www.tu-ilmenau.de

Christian Löwenstein, Dieter Rautenbach

claim paper

Read More »

« Prev « First page 10 / 372 Last » Next »