352 search results - page 7 / 71 » Partitioning Graphs into Connected Parts |
152
click to vote
EJC
2008
15 years 4 months ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
127
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
144
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
222
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
135
Voted
JCT
2008
15 years 3 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...