ANTS: Agents, Networks, Trees, and Subgraphs Export

@misc{citeulike:2796024, abstract = {Efficient exploration of large networks is a central issue in data mining and network maintenance applications. In most existing work there is a distinction between the active \"searcher\" which both executes the algorithm and holds the memory and the passive \"searched graph\" over which the searcher has no control at all. Large dynamic networks like the Internet, where the nodes are powerful computers and the links have narrow bandwidth and are heavily-loaded, call for a different paradigm, in...}, author = {Wagner, Israel A. and Lindenbaum, Michael and Bruckstein, Alfred M.}, citeulike-article-id = {2796024}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/wagner99ant.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/wagner99ant.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/wagner99ant.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/wagner99ant.html}, keywords = {graph\_theory}, posted-at = {2008-05-13 20:43:46}, priority = {2}, title = {ANTS: Agents, Networks, Trees, and Subgraphs}, url = {http://citeseer.ist.psu.edu/wagner99ant.html} }

TY - GEN ID - citeulike:2796024 L3 - citeulike-article-id:2796024 N2 - Efficient exploration of large networks is a central issue in data mining and network maintenance applications. In most existing work there is a distinction between the active "searcher" which both executes the algorithm and holds the memory and the passive "searched graph" over which the searcher has no control at all. Large dynamic networks like the Internet, where the nodes are powerful computers and the links have narrow bandwidth and are heavily-loaded, call for a different paradigm, in... TI - ANTS: Agents, Networks, Trees, and Subgraphs KW - graph_theory AU - Wagner, Israel AU - Lindenbaum, Michael AU - Bruckstein, Alfred UR - http://citeseer.ist.psu.edu/wagner99ant.html ER -