3204 search results - page 152 / 641 » The Alcuin Number of a Graph |
128
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
138
click to vote
FCT
2009
Springer
16 years 17 days ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
164
click to vote
AGTIVE
2007
Springer
16 years 6 days ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...
155
click to vote
PAKDD
2004
ACM
15 years 11 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
128
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...