646 search results - page 28 / 130 » Generalized connected domination in graphs |
100
click to vote
JCT
2011
14 years 9 months ago
2011
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associah...
110
click to vote
IICS
2003
Springer
15 years 7 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
125
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
112
click to vote
IPL
2008
15 years 1 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
SOCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...