1729 search results - page 167 / 346 » On Bounds for the k-Partitioning of Graphs |
146
click to vote
SOFSEM
1997
Springer
15 years 10 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
138
click to vote
COR
2008
15 years 6 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
118
click to vote
DM
2010
15 years 6 months ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
182
click to vote
JCT
2006
15 years 6 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
184
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...