507 search results - page 102 / 102 » Sizes of Ordered Decision Trees |
144
click to vote
ICALP
2009
Springer
16 years 20 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
106
Voted
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...