The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for cliques with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1972-1981 (17) 1982-1987 (16) 1988-1990 (19) 1991-1993 (49) 1994-1995 (22) 1996 (15) 1997-1998 (21) 1999 (15) 2000 (23) 2001 (19) 2002 (24) 2003 (32) 2004 (55) 2005 (44) 2006 (59) 2007 (57) 2008 (68) 2009 (65) 2010 (33) 2011 (37) 2012 (37) 2013 (33) 2014 (34) 2015 (46) 2016 (43) 2017 (44) 2018 (60) 2019 (54) 2020 (63) 2021 (48) 2022 (54) 2023 (59) 2024 (15)
Publication types (Num. hits)
article(712) incollection(6) inproceedings(551) phdthesis(10) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 420 occurrences of 306 keywords

Results
Found 1280 publication records. Showing 1280 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
107Elias Dahlhaus, Marek Karpinski A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). Search on Bibsonomy SWAT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
76Karina Odinaev, Igal Raichelgauz, Yehoshua Y. Zeevi Cliques in Neural Ensembles as Perception Carriers. Search on Bibsonomy IJCNN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
76Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi Linear-Time Enumeration of Isolated Cliques. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
70Kyungsook Han, Guangyu Cui, Yu Chen Identifying Functional Groups by Finding Cliques and Near-Cliques in Protein Interaction Networks. Search on Bibsonomy FBIT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
66Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier Enumerating Isolated Cliques in Synthetic and Financial Networks. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
66Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti Packing r-Cliques in Weighted Chordal Graphs. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF min-max theorems, linear programming duality, complementary slackness, greedy algorithms, chordal graphs
66Jian Pei, Daxin Jiang, Aidong Zhang On mining cross-graph quasi-cliques. Search on Bibsonomy KDD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF bioinformatics, patterns, graph mining
62Nan Du, Christos Faloutsos, Bai Wang 0001, Leman Akoglu Large human communication networks: patterns and a utility-driven generator. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF social networks, cliques, graph generators
62Paul Milbredt, Martin Horauer, Andreas Steininger An investigation of the clique problem in FlexRay. Search on Bibsonomy SIES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
58Egon Balas, William Niehaus Finding large cliques in arbitrary graphs by bipartite matching. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
58Mark K. Goldberg, Reid D. Rivenburgh Constructing cliques using restricted backtracking. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
58David S. Johnson, Michael A. Trick Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
56Martin Nehéz, Daniel Olejár An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF dominating cliques, additive stretch routing scheme, random graphs, Interval routing
56Daxin Jiang, Jian Pei Mining frequent cross-graph quasi-cliques. Search on Bibsonomy ACM Trans. Knowl. Discov. Data The full citation details ... 2009 DBLP  DOI  BibTeX  RDF joint mining, bioinformatics, Graph mining, clique
56Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Pei Xin Parallel Algorithm for Enumerating Maximal Cliques in Complex Network. Search on Bibsonomy Mining Complex Data The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
56Ikno Kim, Junzo Watada Searching Cliques in a Fuzzy Graph Based on an Evolutionary and Biological Method. Search on Bibsonomy KES (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
56Natwar Modani, Kuntal Dey Large maximal cliques enumeration in sparse graphs. Search on Bibsonomy CIKM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF filtering, maximal clique
56Robert Bernecky Shape cliques. Search on Bibsonomy ACM SIGAPL APL Quote Quad The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Takeaki Uno An Efficient Algorithm for Enumerating Pseudo Cliques. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
56Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Xin Pei A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network. Search on Bibsonomy ICDM Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Michael Kaufmann 0001, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Kazuhisa Makino, Takeaki Uno New Algorithms for Enumerating All Maximal Cliques. Search on Bibsonomy SWAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Levent Onural, M. Bilge Alp, Mehmet Izzet Gürelli Gibbs Random Field Model Based Weight Selection for the 2-D Adaptive Weighted Median Filter. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Gibbs random field model based weight selection, 2-D adaptive weighted median filter, generalized filtering method, energy minimisation, 3/spl times/3 square neighborhood structure, clique energies, 3-pixel cliques, 2-pixel cliques, local statistics, filtering and prediction theory, adaptive filters, minimisation, linear filters, two-dimensional digital filters
52Krishnaram Kenthapadi, Gurmeet Singh Manku Decentralized algorithms using both local and random probes for P2P load balancing. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF bins and balls, coupon collection, load balancing, distributed hash tables, peer to peer systems, binary trees, cliques, decentralized algorithms
52Nicolas Barnier, Pascal Brisset Graph Coloring for Air Traffic Flow Management. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF air traffic flow management, route network, graph coloring, constraint programming, greedy algorithm, cliques
51Yinglong Xia, Viktor K. Prasanna Junction tree decomposition for parallel exact inference. Search on Bibsonomy IPDPS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
51Sven Kosub Local Density. Search on Bibsonomy Network Analysis The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
46Frédéric Lerasle, Michel Devy, Jean-Michel Lequellec Relaxation vs. Maximal Cliques Search for Projected Beams Labeling in a Structured Light Sensor. Search on Bibsonomy ICPR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF labeling, constraint propagation, relaxation, structured light, maximal cliques
46Radu Horaud, Thomas Skordas Stereo Correspondence Through Feature Grouping and Maximal Cliques. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF image structure extraction, feature grouping, relational graph, pattern recognition, pattern recognition, segmentation, graph theory, graph theory, picture processing, picture processing, stereo matching, nodes, stereo correspondence, maximal cliques
46Sonal Patel, Eric Harley Estimation of the number of cliques in a random graph. Search on Bibsonomy C3S2E The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
46Thomas Wennekers On the Natural Hierarchical Composition of Cliques in Cell Assemblies. Search on Bibsonomy Cogn. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Clique codes, Formal concept analysis, Associative memory, Bio-inspired computing, Cell assemblies
46Guimei Liu, Limsoon Wong Effective Pruning Techniques for Mining Quasi-Cliques. Search on Bibsonomy ECML/PKDD (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46A. S. Bavan A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph. Search on Bibsonomy SCSS (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Li Wan, Bin Wu 0001, Nan Du, Qi Ye, Ping Chen A New Algorithm for Enumerating All Maximal Cliques in Complex Network. Search on Bibsonomy ADMA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi The Worst-Case Time Complexity for Generating All Maximal Cliques. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
46Yoshiaki Okubo, Makoto Haraguchi Creating Abstract Concepts for Classification by Finding Top- N Maximal Weighted Cliques. Search on Bibsonomy Discovery Science The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Serge Fenet, Christine Solnon Searching for Maximum Cliques with Ant Colony Optimization. Search on Bibsonomy EvoWorkshops The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Hiroko Ishii, Hirotsugu Kakugawa A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems. Search on Bibsonomy SRDS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Feodor F. Dragan, Andreas Brandstädt Dominating Cliques in Graphs with Hypertree Structures. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
43David S. Johnson, Michael A. Trick (eds.) Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993 Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
43Michael A. Trick Appendix: Second DIMACS Challenge test problems. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan Approximately solving Maximum Clique using neural network and related heuristics. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Mark Brockington, Joseph C. Culberson Camouflaging independent sets in quasi-random graphs. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43William M. Spears Simulated annealing for hard satisfiability problems. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Brigitte Jaumard, Mihnea Stan, Jacques Desrosiers Tabu search and a quadratic relaxation for the Satisfiability problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Craig A. Morgenstern Distributed coloration neighborhood search. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Joseph C. Culberson, Feng Luo Exploring the k-colorable landscape with Iterated Greedy. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos A continuous based heuristic for the maximum clique problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang A linear programming and rounding approach to max 2-sat. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Tal Grossman Applying the INN model to the Maximum Clique problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Allen Van Gelder, Yumi K. Tsuji Satisfiability testing with more reasoning and less guessing. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Steven E. Hampson, Dennis F. Kibler Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Daniele Pretolani Efficiency and stability of hypergraph SAT algorithms. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Edward C. Sewell An improved algorithm for exact graph coloring. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Mauricio G. C. Resende, Thomas A. Feo A GRASP for satisfiability. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Patrick Soriano, Michel Gendreau Tabu search algorithms for the maximum clique problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Carlo Mannino, Antonio Sassano Edge projection and the maximum cardinality stable set problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Jean-Marie Bourjolly, Paul Gill, Gilbert Laporte, Hélène Mercure An exact quadratic 0-1 algorithm for the stable set problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Bart Selman, Henry A. Kautz, Bram Cohen Local search strategies for satisfiability testing. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Steven Homer, Marcus Peinado Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Fred W. Glover, Mark Parker, Jennifer Ryan Coloring by tabu branch and bound. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Charles Fleurent, Jacques A. Ferland Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Yuichi Asahiro, Kazuo Iwama, Eiji Miyano Random generation of test instances with controlled attributes. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Olivier Dubois 0002, Pascal André, Yacine Boufkhad, Jacques Carlier SAT versus UNSAT. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Gary Lewandowski, Anne Condon Experiments with parallel graph coloring heuristics and applications of graph coloring. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Richard J. Wallace, Eugene C. Freuder Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki Polyhedral methods for the maximum clique problem. Search on Bibsonomy Cliques, Coloring, and Satisfiability The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
41Gerard Sanroma, Francesc Serratosa, René Alquézar Hybrid Genetic Algorithm and Procrustes Analysis for Enhancing the Matching of Graphs Generated from Shapes. Search on Bibsonomy SSPR/SPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF procrustes analysis, cliques model, shape analysis, graph matching, hybrid genetic algorithm
41Jianbo Li, Mingxia Chen, Jianping Li 0007, Weidong Li 0002 Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithm, Interval graph, cliques
41Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker Matching Hierarchical Structures Using Association Graphs. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Maximal subtree isomorphisms, replicator dynamical systems, shock trees, shape recognition, maximal cliques, association graphs
41Stavros D. Nikolopoulos Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. Search on Bibsonomy CONPAR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Parallel algorithms, Complexity, Recognition, Graph partition, Chordal graphs, Maximal cliques, Distance matrix
41Tsung Teng Chen, Liang Chi Hsieh The Visualization of Relatedness. Search on Bibsonomy IV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond Clustering with Partial Information. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis Out-of-core coherent closed quasi-clique mining from large dense graph databases. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF coherent subgraph, frequent closed subgraph, quasi-clique, Graph mining, out-of-core algorithm
41Sylvain Dahan Distributed Spanning Tree Algorithms for Large Scale Traversals. Search on Bibsonomy ICPADS (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Yanbing Xu, Mostafa I. H. Abd-El-Barr, Carl McCrosky Graph-based output phase assignment for PLA minimization. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
36Sándor P. Fekete, Henk Meijer Maximum Dispersion and Geometric Maximum Weight Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques
35Henryk Potrzebowski, Jaroslaw Tomasz Stanczak, Krzysztof Sep Separable Decomposition of Graph Using alpha- cliques. Search on Bibsonomy Computer Recognition Systems 2 The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Samuel Rota Bulò, Marcello Pelillo A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs. Search on Bibsonomy LION The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Iwona Cieslik On-line coloring and cliques covering for KKs, t-free graphs. Search on Bibsonomy Acta Informatica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Ioan Tomescu On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Olivier Pereira, Jean-Jacques Quisquater A Security Analysis of the Cliques Protocols Suites. Search on Bibsonomy CSFW The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Marcello Pelillo Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. Search on Bibsonomy EMMCVPR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg Graph Clustering Using Distance-k Cliques. Search on Bibsonomy GD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
31Victor Felea On Containment of Conjunctive Queries with Negation. Search on Bibsonomy ADBIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF maximal sets, cliques in graphs, negation, query containment
31Alvin Chin, Mark H. Chignell Identifying subcommunities using cohesive subgroups in social hypertext. Search on Bibsonomy Hypertext The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cohesive subgroups, k-plexes, n-cliques, social hypertext, subcommunities, social networks, virtual community
31Mohammed Javeed Zaki, Markus Peters, Ira Assent, Thomas Seidl 0001 CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. Search on Bibsonomy KDD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF k-partite graph, data mining, clustering, categorical data, maximal cliques
31Steven D. Prestwich Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF hybrid search, n-queens, maximum cliques, Golomb rulers
31Krisztián Tichler Extremal Theorems for Databases. Search on Bibsonomy FoIKS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF antikeys, labelled directed tree, extremal problems, cliques, keys, maximal independent sets, relational database model
31Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Hannes Moser, Rolf Niedermeier, Manuel Sorge Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. Search on Bibsonomy SEA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Chun-Hua Fu, Yue-Ping Zhou, Xiu-Lian Xu, Hui Chang, Ai-Xia Feng, Jianjun Shi, Da-Ren He Recognition of Important Subgraphs in Collaboration Networks. Search on Bibsonomy Complex (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF shifted power law, bipartite graph, clique, collaboration network, subgraph
31Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
31Ghazi Al-Naymat Enumeration of maximal clique for mining spatial co-location patterns. Search on Bibsonomy AICCSA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo A Continuous-Based Approach for Partial Clique Enumeration. Search on Bibsonomy GbRPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Florian Verhein, Ghazi Al-Naymat Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT. Search on Bibsonomy ICDM Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
31Haim Kaplan, Micha Sharir, Elad Verbin Colored intersection searching via sparse rectangular matrix multiplication. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF colored intersection searching, generalized intersection searching, matrix multiplication, range searching
31Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis Coherent closed quasi-clique discovery from large dense graph databases. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coherent subgraph, quasi-clique, graph mining
31Xiaohong Sheng, Yu Hen Hu, Parmesh Ramanathan Distributed particle filter with GMM approximation for multiple targets localization and tracking in wireless sensor network. Search on Bibsonomy IPSN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca Computing Branchwidth Via Efficient Triangulations and Blocks. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1280 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license