Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases

[1]  Philip S. Yu,et al.  Fast computing reachability labelings for large graphs with high compression rate , 2008, EDBT '08.

[2]  É. Ghys,et al.  Sur Les Groupes Hyperboliques D'Apres Mikhael Gromov , 1990 .

[3]  Cyril Gavoille,et al.  Tree-decompositions with bags of small diameter , 2007, Discret. Math..

[4]  Yang Xiang,et al.  Additive Spanners for Circle Graphs and Polygonal Graphs , 2008, WG.

[5]  Ittai Abraham,et al.  Reconstructing approximate tree metrics , 2007, PODC '07.

[6]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[7]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[8]  Cyril Gavoille,et al.  Memory Requirements for Routing in Distributed Networks (Extended Abstract). , 1996, PODC 1996.

[9]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[10]  Dimitrios Gunopulos,et al.  Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.

[11]  Martin Kalin,et al.  A graph generation software package , 1991, SIGCSE '91.

[12]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.

[13]  Jilles Vreeken,et al.  Compression Picks Item Sets That Matter , 2006, PKDD.

[14]  Yang Xiang,et al.  Compact and low delay routing labeling scheme for Unit Disk Graphs , 2009, Comput. Geom..

[15]  Cyril Gavoille,et al.  A survey on interval routing , 2000, Theor. Comput. Sci..

[16]  Mikkel Thorup.  Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[17]  Lada A. Adamic,et al.  Local Search in Unstructured Networks , 2002, ArXiv.

[18]  Cyril Gavoille,et al.  Space-Efficiency for Routing Schemes of Stretch Factor Three , 2001, J. Parallel Distributed Comput..

[19]  Yang Xiang,et al.  Efficiently answering reachability queries on very large directed graphs , 2008, SIGMOD Conference.

[20]  Nicola Santoro,et al.  Labelling and Implicit Routing in Networks , 1985, Computer/law journal.

[21]  Monika Henzinger,et al.  Maintaining Minimum Spanning Trees in Dynamic Graphs , 1997, ICALP.

[22]  Feodor F. Dragan,et al.  Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs , 2008, SCG '08.

[23]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[24]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[25]  Cyril Gavoille,et al.  Localized and Compact Data-Structure for Comparability Graphs , 2005, ISAAC.

[26]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[27]  Jilles Vreeken,et al.  Item Sets that Compress , 2006, SDM.

[28]  Gerhard Weikum,et al.  HOPI: An Efficient Connection Index for Complex XML Document Collections , 2004, EDBT.

[29]  Feodor F. Dragan,et al.  Collective Tree Spanners and Routing in AT-free Related Graphs , 2004, WG.

[30]  Yuval Shavitt,et al.  Hyperbolic embedding of internet graph for distance estimation and overlay construction , 2008, TNET.

[31]  Toon Calders,et al.  Non-derivable itemset mining , 2007, Data Mining and Knowledge Discovery.

[32]  Yang Xiang,et al.  Path-tree: An efficient reachability indexing scheme for large directed graphs , 2011, TODS.

[33]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[34]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[35]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[36]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[37]  Yang Xiang,et al.  Summarizing transactional databases with overlapped hyperrectangles , 2011, Data Mining and Knowledge Discovery.

[38]  Martin Ester,et al.  Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description , 2006, Sixth International Conference on Data Mining (ICDM'06).

[39]  Jignesh M. Patel,et al.  Efficient aggregation for graph summarization , 2008, SIGMOD Conference.

[40]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[41]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[42]  Jean-François Boulicaut,et al.  Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries , 2004, Data Mining and Knowledge Discovery.

[43]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[44]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[45]  Cyril Gavoille,et al.  Optimal Distance Labeling for Interval and Circular-Arc Graphs , 2003, ESA.

[46]  Cyril Gavoille,et al.  Approximate Distance Labeling Schemes , 2000, Electron. Notes Discret. Math..

[47]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[48]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[49]  David Peleg,et al.  Proximity-Preserving Labeling Schemes and Their Applications , 1999, WG.

[50]  Vipin Kumar,et al.  Summarization - compressing data into an informative representation , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[51]  Bruno Courcelle,et al.  Query efficient implementation of graphs of bounded clique-width , 2003, Discret. Appl. Math..

[52]  Feodor F. Dragan,et al.  Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width , 2005, ISAAC.

[53]  Amit Kumar,et al.  Traveling with a Pez dispenser (or, routing issues in MPLS) , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[54]  Klaus Simon,et al.  An Improved Algorithm for Transitive Closure on Acyclic Digraphs , 1986, Theor. Comput. Sci..

[55]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[56]  Luc De Raedt,et al.  Mining Bi-sets in Numerical Data , 2006, KDID.

[57]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[58]  Aristides Gionis,et al.  Approximating a collection of frequent sets , 2004, KDD.

[59]  Feodor F. Dragan,et al.  Collective Tree 1-Spanners for Interval Graphs , 2005, WG.

[60]  Olivier Ly,et al.  Distance Labeling in Hyperbolic Graphs , 2005, ISAAC.

[61]  Anurag Agarwal,et al.  Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding , 2005, Euro-Par.

[62]  David Peleg,et al.  Compact routing schemes with low stretch factor , 2003, J. Algorithms.

[63]  Feodor F. Dragan,et al.  On the power of BFS to determine a graph's diameter , 2003, Networks.

[64]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[65]  Cyril Gavoille,et al.  Distance labeling scheme and split decomposition , 2003, Discret. Math..

[66]  Yang Xiang,et al.  Collective Additive Tree Spanners of Homogeneously Orderable Graphs , 2008, LATIN.

[67]  Yangjun Chen,et al.  An Efficient Algorithm for Answering Graph Reachability Queries , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[68]  Philippe Jacquet,et al.  Remote-spanners: What to know beyond neighbors , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[69]  Jilles Vreeken,et al.  Characterising the difference , 2007, KDD '07.

[70]  Elsev Iek.  The algorithmic use of hypertree structure and maximum neighbourhood orderings , 2003 .

[71]  Ehab S. Elmallah,et al.  Polygon Graph Recognition , 1998, J. Algorithms.

[72]  Laks V. S. Lakshmanan,et al.  The Generalized MDL Approach for Summarization , 2002, VLDB.

[73]  Yang Xiang,et al.  Generalized Powers of Graphs and Their Algorithmic Use , 2006, SWAT.

[74]  Ulf Leser,et al.  Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.

[75]  Yang Xiang,et al.  Overlapping Matrix Pattern Visualization: A Hypergraph Approach , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[76]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[77]  Yon Dourisboure.  Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs , 2004, DISC.

[78]  Feodor F. Dragan,et al.  Collective Tree Spanners of Graphs , 2004, SWAT.

[79]  Aristides Gionis,et al.  Geometric and Combinatorial Tiles in 0-1 Data , 2004, PKDD.

[80]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[81]  Pierre Fraigniaud,et al.  Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation , 2007, ESA.

[82]  Hui Xiong,et al.  The minimum consistent subset cover problem and its applications in data mining , 2007, KDD '07.

[83]  Feodor F. Dragan.  Estimating all pairs shortest paths in restricted graph families: a unified approach , 2005, J. Algorithms.

[84]  Ivan Stojmenovic,et al.  Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy , 2004 .

[85]  A. O. Houcine.  On hyperbolic groups , 2006 .

[86]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[87]  Yang Xiang,et al.  3-HOP: a high-compression indexing scheme for reachability query , 2009, SIGMOD Conference.

[88]  Jian Pei,et al.  Mining Condensed Frequent-Pattern Bases , 2003, Knowledge and Information Systems.

[89]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[90]  Philip Bille,et al.  Labeling schemes for small distances in trees , 2003, SODA '03.

[91]  Feodor F. Dragan,et al.  Dually Chordal Graphs , 1998, SIAM J. Discret. Math..

[92]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[93]  Bart Goethals,et al.  Tiling Databases , 2004, Discovery Science.

[94]  Cyril Gavoille,et al.  Compact Routing Tables for Graphs of Bounded Genus , 1999, ICALP.

[95]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[96]  Lenore Cowen,et al.  Compact routing with minimum stretch , 1999, SODA '99.

[97]  Felix C. Gaertner,et al.  A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms , 2003 .

[98]  Vipin Kumar,et al.  Support envelopes: a technique for exploring the structure of association patterns , 2004, KDD.

[99]  Tao Li,et al.  A general model for clustering binary data , 2005, KDD '05.

[100]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[101]  Pierre Fraigniaud,et al.  Local MST computation with short advice , 2007, SPAA.

[102]  Yang Xiang,et al.  Succinct summarization of transactional databases: an overlapped hyperrectangle scheme , 2008, KDD.

[103]  Philip S. Yu,et al.  Dual Labeling: Answering Graph Reachability Queries in Constant Time , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[104]  Guy Kortsarz,et al.  Generating Sparse 2-Spanners , 1994, J. Algorithms.

[105]  Martín Matamala,et al.  Navigating in a Graph by Aid of Its Spanning Tree , 2008, ISAAC.

[106]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[107]  Ittai Abraham,et al.  Object location using path separators , 2006, PODC '06.

[108]  Philip S. Yu,et al.  Fast Computation of Reachability Labeling for Large Graphs , 2006, EDBT.

[109]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[110]  Philip S. Yu,et al.  Substructure similarity search in graph databases , 2005, SIGMOD '05.

[111]  Li Chen,et al.  Stack-based Algorithms for Pattern Matching on DAGs , 2005, VLDB.

[112]  Pierre Fraigniaud,et al.  Routing in Trees , 2001, ICALP.

[113]  Cyril Gavoille,et al.  Routing in distributed networks: overview and open problems , 2001, SIGA.

[114]  Jianyong Wang,et al.  On efficiently summarizing categorical databases , 2005, Knowledge and Information Systems.

[115]  H. Short,et al.  Notes on word hyperbolic groups , 1991 .

[116]  Ran Raz,et al.  Distance labeling in graphs , 2001, SODA '01.

[117]  David S. Johnson,et al.  Compressing Large Boolean Matrices using Reordering Techniques , 2004, VLDB.