4009 search results - page 264 / 802 » Clustering on Complex Graphs |
156
Voted
FAC
2002
15 years 5 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
153
Voted
JDA
2010
15 years 4 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
194
click to vote
IWOCA
2010
Springer
15 years 13 days ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
167
click to vote
DDECS
2008
IEEE
16 years 2 days ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
132
click to vote
HICSS
2008
IEEE
16 years 2 days ago
2008
IEEE
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...