Search results for "Cliques"

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