4913 search results - page 179 / 983 » Results and Perspectives of the G |
165
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
146
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
136
click to vote
DM
2008
15 years 6 months ago
2008
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
191
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
155
click to vote
JCC
2006
15 years 6 months ago
2006
If a macromolecule is described by curvilinear coordinates or rigid constraints are imposed, the equilibrium probability density that must be sampled in Monte Carlo simulations in...