Hypergraph products for structural mechanics, Advances in Engineering Software, vol.80 ,
DOI : 10.1016/j.advengsoft.2014.09.017
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1 ,
DOI : 10.1137/S1064827595287997
On an Application of the New Atomic Theory to the Graphical Representation of the Invariants and Covariants of Binary Quantics, with Three Appendices, American Journal of Mathematics, vol.1, issue.1, pp.64-104, 1878. ,
DOI : 10.2307/2369436
An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.8, issue.5, pp.604-6184767835, 1986. ,
DOI : 10.1109/TPAMI.1986.4767835
Graphlab: A new parallel framework for machine learning, Conference on Uncertainty in Artificial Intelligence (UAI), 2010. ,
Pregel: A system for large-scale ,
Graph partitioning and constructing optimal decision trees are polynomial complete problems ,
DOI : 10.1016/0020-0190(76)90095-8
Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976. ,
DOI : 10.1016/0304-3975(76)90059-1
URL : https://doi.org/10.1016/0304-3975(76)90059-1
Balanced graph partitioning, Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '04, pp.120-124, 2004. ,
DOI : 10.1007/s00224-006-1350-7
URL : http://www.dcs.warwick.ac.uk/~harry/pdf/balanced_partition_journal.pdf
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Fast Approximate Graph Partitioning Algorithms, SIAM Journal on Computing, vol.28, issue.6, pp.2187-2214, 1999. ,
DOI : 10.1137/S0097539796308217
A polylogarithmic approximation of the minimum bisection, SIAM J. Comput, 2002. ,
Partitioning Graphs into Balanced Components, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009. ,
DOI : 10.1137/1.9781611973068.102
URL : http://www.wisdom.weizmann.ac.il/~robi/papers/KNS-k-partition-SODA09.pdf
A hypergraph-partitioning approach for coarse-grain decomposition, Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, SC '01, pp.28-28, 2001. ,
Hypergraph partitioning and clustering, 2007. ,
Parallel multilevel algorithms for hypergraph partitioning, Journal of Parallel and Distributed Computing, vol.68, issue.5, pp.563-581, 2008. ,
DOI : 10.1016/j.jpdc.2007.11.002
Abusing a hypergraph partitioner for unweighted graph partitioning. Graph Partitioning and Graph Clustering, pp.19-35, 2012. ,
Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010. ,
DOI : 10.1016/j.physrep.2009.11.002
URL : http://arxiv.org/pdf/0906.0612v1.pdf
Community detection and graph partitioning, EPLEurophysics Letters), vol.103, issue.2, p.28003, 2013. ,
Strategic Power Infrastructure Defense, Proceedings of the IEEE, vol.93, issue.5, pp.918-933, 2005. ,
DOI : 10.1109/JPROC.2005.847260
Power system reconfiguration based on multilevel graph partitioning, 2009 IEEE Bucharest PowerTech, pp.1-5, 2009. ,
DOI : 10.1109/PTC.2009.5281971
Analysis of biological networks ,
An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilität-von der Forschung zur praktischen Anwendung, pp.219-230, 2004. ,
Distributed Time-Dependent Contraction Hierarchies, SEA, pp.83-93, 2010. ,
DOI : 10.1007/978-3-642-13193-6_8
Customizable Route Planning, Proceedings of the 10th International Conference on Experimental Algorithms, pp.376-387, 2011. ,
DOI : 10.1007/3-540-45643-0_4
URL : http://i11www.ira.uka.de/extra/publications/dw-tdrp-09.pdf
ISBN 978-3-642-20661-0. URL http, 2008657. ,
Candidate sets for alternative routes in road networks, J. Exp. Algorithmics, vol.197, issue.2, pp.1-2, 2015. ,
Faster Customization of Road Networks, International Symposium on Experimental Algorithms, pp.30-42, 2013. ,
DOI : 10.1007/978-3-642-38527-8_5
A survey of graph theoretical approaches to image segmentation, Pattern Recognition, vol.46, issue.3, pp.1020-1038, 2013. ,
DOI : 10.1016/j.patcog.2012.09.015
A review on graph based segmentation, International Journal of Image Graphics and Signal Processing, vol.4, issue.51, 2012. ,
VLSI physical design: from graph partitioning to timing closure, 2011. ,
Finding sparse cuts locally using evolving sets, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, 2009. ,
DOI : 10.1145/1536414.1536449
URL : http://arxiv.org/pdf/0811.3779v1.pdf
Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices, IBM Technical Disclosure Bulletin, vol.15, issue.3, pp.938-944, 1972. ,
Lower Bounds for the Partitioning of Graphs, IBM Journal of Research and Development, vol.17, issue.5, pp.420-425, 1973. ,
DOI : 10.1147/rd.175.0420
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory, Czechoslovak Mathematical Journal, vol.25, issue.4, pp.619-633, 1975. ,
Partitioning Sparse Matrices with Eigenvectors of Graphs, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.3, pp.430-452, 1990. ,
DOI : 10.1137/0611030
Partitioning of unstructured problems for parallel processing Computing systems in engineering, pp.135-148, 1991. ,
New spectral methods for ratio cut partitioning and clustering. IEEE transactions on computer-aided design of integrated circuits and systems, pp.1074-1085, 1992. ,
DOI : 10.1109/43.159993
Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency and computation: Practice and Experience, pp.101-117, 1994. ,
A multilevel algorithm for partitioning graphs, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, 1995. ,
DOI : 10.1145/224170.224228
A separator theorem for planar graphs, 1977. ,
Analysis of multilevel graph partitioning, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, 1995. ,
DOI : 10.1145/224170.224229
URL : http://glaros.dtc.umn.edu/gkhome/fetch/papers/mlevel_analysis.pdf
An Efficient Heuristic Procedure for Partitioning Graphs. The Bell Systems Technical Journal, 1970. ,
DOI : 10.1002/j.1538-7305.1970.tb01770.x
New spectral methods for ratio cut partitioning and clustering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.11, issue.9, 2006. ,
DOI : 10.1109/43.159993
A linear-time heuristic for improving network partitions, Proceedings of the 19th Design Automation Conference, pp.175-181, 1982. ,
DOI : 10.1145/800263.809204
URL : http://www.comp.nus.edu.sg/~cs5234/2007-08/Lectures/L07/paper-fm.pdf
A heuristic for reducing fill-in in sparse matrix factorization, Society for Industrial and Applied Mathematics (SIAM), 1993. ,
Heuristic algorithms for automatic graph partitioning, 1994. ,
On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Numerical Algorithms, vol.2, issue.1, pp.193-214, 1996. ,
DOI : 10.1002/j.1538-7305.1970.tb01770.x
Graph partitioning and parallel solvers: Has the emperor no clother? (extended abstract), Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR '98, pp.218-225, 1998. ,
DOI : 10.1007/bfb0018541
Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency and Computation: Practice and Experience, Bibliography, vol.3, issue.118, pp.457-481, 1991. ,
Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics, International Journal for Numerical Methods in Engineering, vol.32, issue.5, pp.745-764, 1993. ,
DOI : 10.1002/nme.1620360503
A unified geometric approach to graph separators, Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on, pp.538-547, 1991. ,
Geometric mesh partitioning: Implementation and experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998. ,
Distributed Balanced Partitioning via Linear Embedding, Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, WSDM '16, 2016. ,
DOI : 10.14778/2733085.2733103
URL : http://dl.acm.org/ft_gateway.cfm?id=2835829&type=pdf
On the metric properties of discrete space-filling curves, IEEE Transactions on Image Processing, vol.5, issue.5, pp.794-797, 1996. ,
DOI : 10.1109/83.499920
Towards optimal locality in mesh-indexings, Discrete Applied Mathematics, vol.117, issue.1-3, pp.211-237, 2002. ,
DOI : 10.1016/S0166-218X(00)00326-7
URL : https://doi.org/10.1016/s0166-218x(00)00326-7
Optimal linear arrangement of a rectangular grid, Discrete Mathematics, vol.213, issue.1-3, pp.123-139, 2000. ,
DOI : 10.1016/S0012-365X(99)00173-9
Streaming graph partitioning for large distributed graphs, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12 ,
DOI : 10.1145/2339530.2339722
URL : http://www.eecs.berkeley.edu/~isabelle/papers/kdd325-stanton.pdf
Streaming Balanced Graph Partitioning Algorithms for Random Graphs, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014. ,
DOI : 10.1137/1.9781611973402.95
URL : http://biglearn.org/2012/files/papers/biglearning2012_submission_1.pdf
FENNEL, Proceedings of the 7th ACM international conference on Web search and data mining, WSDM '14, 2014. ,
DOI : 10.1145/2556195.2556213
Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning, 2014 IEEE International Conference on Big Data (Big Data), 2014. ,
DOI : 10.1109/BigData.2014.7004368
URL : https://hal.archives-ouvertes.fr/hal-01282071
Restreaming graph partitioning, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '13, 2013. ,
DOI : 10.1145/2487575.2487696
Partial Restreaming Approach for Massive Graph Partitioning, 2014 Tenth International Conference on Signal-Image Technology and Internet-Based Systems, 2014. ,
DOI : 10.1109/SITIS.2014.59
URL : https://hal.archives-ouvertes.fr/hal-01282078
Graph Partitioning URL http://liris.cnrs.fr/publis/?id=5317, 2011. ,
Streaming METIS partitioning, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2016. ,
DOI : 10.1109/ASONAM.2016.7752208
URL : https://hal.archives-ouvertes.fr/hal-01405170
Efficient aggregation for graph summarization, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.567-580, 2008. ,
DOI : 10.1145/1376616.1376675
URL : http://www.cs.wisc.edu/~jignesh/publ/summarization.pdf
Graph aggregation, Artificial Intelligence, vol.245, pp.86-114, 2017. ,
DOI : 10.1016/j.artint.2017.01.001
Ontology Merging as Social Choice, International Workshop on Computational Logic in Multi-Agent Systems, pp.157-170, 2011. ,
DOI : 10.1093/logcom/exn048
URL : http://www.illc.uva.nl/Publications/PP-2011-14.text.pdf
A vector space model for automatic indexing, Communications of the ACM, vol.18, issue.11, pp.613-620, 1975. ,
DOI : 10.1145/361219.361220
Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval, Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '94, pp.232-241, 1994. ,
DOI : 10.1007/978-1-4471-2099-5_24
A language modeling approach to information retrieval, Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '98, pp.275-281, 1998. ,
Workshop on aggregated search, ACM SIGIR Forum, vol.42, issue.2, pp.80-83, 2008. ,
DOI : 10.1145/1480506.1480520
Aggregated search, ACM Computing Surveys, vol.46, issue.3, pp.1-4131, 2014. ,
DOI : 10.1145/2064730.2064735
URL : https://hal.archives-ouvertes.fr/hal-01123809
Leveraging query associations in federated search, Proceedings of the SIGIR 2008 Workshop on Aggregated Search, 2008. ,
The FedLemur project: Federated search in the real world, Journal of the American Society for Information Science and Technology, vol.24, issue.3, pp.347-358, 2006. ,
DOI : 10.1145/860435.860490
Distributed information retrieval Advances in information retrieval, pp.127-150, 2002. ,
Aggregated search. Advanced topics on information retrieval, 2011. ,
DOI : 10.1007/978-3-642-20946-8_5
Overview of the trec 2007 question answering track, Trec, p.63, 2007. ,
FIDJI: using syntax for validating answers in multiple documents, Information Retrieval, vol.47, issue.4, pp.507-533, 2010. ,
DOI : 10.1007/s10791-010-9131-y
Focused and aggregated search: a perspective from natural language generation, Information Retrieval, vol.63, issue.1???2, pp.434-459, 2010. ,
DOI : 10.1007/978-1-4757-5945-7_1
URL : http://es.csiro.au/pubs/paris_ir09.pdf
Generating Personal Travel Guides - And Who Wants Them?, International Conference on User Modeling, pp.251-253, 2001. ,
DOI : 10.1007/3-540-44566-8_36
Automatically generating Wikipedia articles, Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1, ACL-IJCNLP '09, pp.208-216, 2009. ,
DOI : 10.3115/1687878.1687909
Composite Retrieval of Diverse and Complementary Bundles, IEEE Transactions on Knowledge and Data Engineering, vol.26, issue.11, pp.2662-2675, 2014. ,
DOI : 10.1109/TKDE.2014.2306678
Social choice theory. Handbook of mathematical economics, pp.1073-1181, 1986. ,
Aggregated search, ACM Computing Surveys, vol.46, issue.3, pp.1-31, 2014. ,
DOI : 10.1145/2064730.2064735
URL : https://hal.archives-ouvertes.fr/hal-01123809
Sofie: A self-organizing framework for information extraction, Proceedings of the 18th International Conference on World Wide Web, pp.631-640, 2009. ,
The voting model for people search, ACM SIGIR Forum, vol.43, issue.1, pp.73-73, 2009. ,
DOI : 10.1145/1670598.1670616
Attribute Retrieval from Relational Web Tables, String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011. Proceedings, pp.117-128978, 2011. ,
DOI : 10.1016/j.datak.2008.08.009
Graph indexing, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.335-346 ,
DOI : 10.1145/1007568.1007607
Graph indexing and querying: a review, International Journal of Web Information Systems, vol.6, issue.2, pp.101-120, 2010. ,
DOI : 10.1145/1353343.1353369
Closure-tree: An index structure for graph queries, Proceedings of the 22Nd International Conference on Data Engineering, ICDE '06, p.38, 2006. ,
Graph database indexing using structured graph decomposition, Data Engineering IEEE 23rd International Conference on, pp.976-985, 2007. ,
GraphGrep: A fast and universal method for querying graphs, Object recognition supported by user interaction for service robots, pp.112-115, 2002. ,
DOI : 10.1109/ICPR.2002.1048250
Efficient matching and indexing of graph models in content-based retrieval, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.10, pp.1089-1105, 2001. ,
DOI : 10.1109/34.954600
M-tree: An efficient access method for similarity search in metric spaces, Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB '97, pp.426-435 ,
An algorithm for graph optimal monomorphism, IEEE Transactions on Systems, Man, and Cybernetics, vol.20, issue.3, pp.628-638, 1990. ,
Graph optimal monomorphism algorithms, IEEE Transactions on Systems, Man, and Cybernetics, vol.10, issue.4, pp.181-188, 1980. ,
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.31, issue.03, pp.265-298, 2004. ,
DOI : 10.1109/3477.956043
URL : https://hal.archives-ouvertes.fr/hal-01408706
The design and analysis of computer algorithms, 1974. ,
Linear time algorithm for isomorphism of planar graphs (preliminary report), Proceedings of the sixth annual ACM symposium on Theory of computing, pp.172-184, 1974. ,
Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of computer and system sciences, vol.25, issue.1, pp.42-65, 1982. ,
Graph pattern matching, Proceedings of the VLDB Endowment, vol.3, issue.1-2, 2010. ,
DOI : 10.14778/1920841.1920878
Detecting Social Positions Using Simulation, 2010 International Conference on Advances in Social Networks Analysis and Mining, pp.48-55, 2010. ,
DOI : 10.1109/ASONAM.2010.52
Capturing topology in graph pattern matching, Proc. VLDB Endow, 2011. ,
DOI : 10.14778/2095686.2095690
URL : http://vldb.org/pvldb/vol5/p310_shuaima_vldb2012.pdf
TreePi: A Novel Graph Indexing Method, 2007 IEEE 23rd International Conference on Data Engineering, 2007. ,
DOI : 10.1109/ICDE.2007.368955
URL : https://mailserver.di.unipi.it/ricerca/proceedings/ICDE07/content/data/095_R24-3-513-Zhang.pdf
Graph indexing: Tree + delta = graph, Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB '07, pp.938-949, 2007. ,
Compressed feature-based filtering and verification approach for subgraph search, Proceedings of the 16th International Conference on Extending Database Technology, EDBT '13, pp.287-298 ,
DOI : 10.1145/2452376.2452411
URL : http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a27-gouda.pdf
Fg-index, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, 2007. ,
DOI : 10.1145/1247480.1247574
Taming verification hardness, Proceedings of the VLDB Endowment, vol.1, issue.1, 2008. ,
DOI : 10.14778/1453856.1453899
SAGA: a subgraph matching tool for biological graphs, Bioinformatics, vol.17, issue.2, 2007. ,
DOI : 10.1016/S1074-7613(02)00364-3
NeMa, Proceedings of the 39th international conference on Very Large Data Bases, PVLDB'13, 2013. ,
DOI : 10.14778/2535569.2448952
BLINKS, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, p.7 ,
DOI : 10.1145/1247480.1247516
A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.10 ,
DOI : 10.1109/TPAMI.2004.75
An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1 ,
DOI : 10.1145/321921.321925
URL : http://www.cs.bgu.ac.il/~dinitz/Course/SS-12/Ullman_Algorithm.pdf
Graph homomorphism revisited for graph matching, Proc. VLDB Endow ,
DOI : 10.14778/1920841.1920986
URL : http://www.comp.nus.edu.sg/%7Evldb2010/proceedings/files/papers/R103.pdf
Graph similarity scoring and matching, Applied Mathematics Letters, vol.21, issue.1, pp.86-94, 2008. ,
Pathblast: a tool for alignment of protein interaction networks, Nucleic Acids Res, 2004. ,
NetAlign: a web-based tool for comparison of protein interaction networks, Bioinformatics, vol.14, issue.17, 2006. ,
DOI : 10.1101/gr.1774904
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology, Proc. of RECOMB'11 ,
DOI : 10.1007/978-3-540-71681-5_2
Propagation-vectors for trees (pvt): Concise yet effective summaries for hierarchical data and trees, Proc. of the LSDS-IR'08 ACM Workshop ,
Neighborhood based fast graph search in large networks, Proceedings of the 2011 international conference on Management of data, SIGMOD '11 ,
DOI : 10.1145/1989323.1989418
Cp/cv: Concept similarity mining without frequency information from domain describing taxonomies, Proc. of CIKM'15 ,
A spreading activation theory of memory, Journal of verbal learning and verbal behavior, 1983. ,
Matching structure and semantics: A survey on graph-based pattern matching, AAAI FS, 2006. ,
gStore, Proc. VLDB Endow, 2011. ,
DOI : 10.14778/2002974.2002976
Aggregated Search in Graph Databases: Preliminary Results, International Workshop on Graph-Based Representations in Pattern Recognition, 2011. ,
DOI : 10.1109/ICDE.2007.368955
URL : https://hal.archives-ouvertes.fr/hal-01354546
A Relational-Based Approach for Aggregated Search in Graph Databases, International Conference on Database Systems for Advanced Applications, 2012. ,
DOI : 10.1007/978-3-642-29038-1_5
URL : https://hal.archives-ouvertes.fr/hal-01353115
Maximum common subgraph isomorphism algorithms for the matching of chemical structures, Journal of computer-aided molecular design, 2002. ,
Web graph similarity for anomaly detection (poster), Proceeding of the 17th international conference on World Wide Web , WWW '08, p.8 ,
DOI : 10.1145/1367497.1367709
URL : http://www2008.org/papers/pdf/p1167-papadimitriouA.pdf
CLASSIFICATION OF WEB DOCUMENTS USING GRAPH MATCHING, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, 2004. ,
DOI : 10.1016/S0167-8655(01)00022-8
eMailSift: Email Classification Based on Structure and Content, Fifth IEEE International Conference on Data Mining (ICDM'05) ,
DOI : 10.1109/ICDM.2005.58
Some simplified np-complete graph problems, Theoretical computer science, vol.1, issue.3, pp.237-267, 1976. ,
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs, Journal of Graph Algorithms and Applications, vol.11, issue.1, 2007. ,
DOI : 10.7155/jgaa.00139
URL : https://hal.archives-ouvertes.fr/hal-01408699