4171 search results - page 511 / 835 » Choice numbers of graphs |
165
Voted
CSC
2008
15 years 8 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
146
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
183
click to vote
IJCAI
2001
15 years 8 months ago
2001
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
175
click to vote
MCU
2004
15 years 8 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
179
click to vote
CPC
2006
15 years 6 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...