1605 search results - page 42 / 321 » On Partitional Labelings of Graphs |
120
Voted
DM
2008
15 years 3 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
108
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
137
click to vote
IJDSN
2008
15 years 3 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
110
click to vote
SC
1995
ACM
15 years 7 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
124
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...