3211 search results - page 170 / 643 » On the Grundy Number of a Graph |
142
click to vote
SC
1995
ACM
15 years 10 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 ...
168
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
168
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
176
click to vote
RSA
2008
15 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
187
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...