646 search results - page 64 / 130 » Generalized connected domination in graphs |
JGT
2008
13 years 8 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
PODC
1990
ACM
14 years 24 days ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
JDA
2008
13 years 8 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
JCO
2010
13 years 7 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...