145 search results - page 7 / 29 » A new characterization of HH-free graphs |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
IM
2006
14 years 9 months ago
2006
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
We present in this paper a method to insert new concepts in an existing information extraction system based on a conceptual graph architecture. We use verb patterns as conceptual s...
APAL
2011
14 years 4 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
63
Voted
SIGCOMM
2009
ACM
15 years 4 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...