745 search results - page 82 / 149 » On Generating Random Network Structures: Connected Graphs |
132
Voted
ICDAR
2011
IEEE
14 years 7 days ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
88
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
108
click to vote
WG
1998
Springer
15 years 4 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
120
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
105
Voted
GG
2004
Springer
15 years 6 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...