|
|
Venues (Conferences, Journals, ...)
|
|
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 |
107 | Elias Dahlhaus, Marek Karpinski |
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 139-144, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
76 | Karina Odinaev, Igal Raichelgauz, Yehoshua Y. Zeevi |
Cliques in Neural Ensembles as Perception Carriers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2006, part of the IEEE World Congress on Computational Intelligence, WCCI 2006, Vancouver, BC, Canada, 16-21 July 2006, pp. 285-292, 2006, IEEE, 0-7803-9490-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
76 | Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi |
Linear-Time Enumeration of Isolated Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 119-130, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FBIT ![In: Frontiers in the Convergence of Bioscience and Information Technologies 2007, FBIT 2007, Jeju Island, Korea, October 11-13, 2007, pp. 159-164, 2007, IEEE Computer Society, 978-0-7695-2999-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
66 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Enumerating Isolated Cliques in Synthetic and Financial Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 405-416, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
66 | Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Packing r-Cliques in Weighted Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 138(1), pp. 179-187, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005, pp. 228-238, 2005, ACM, 1-59593-135-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 269-278, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIES ![In: IEEE Third International Symposium on Industrial Embedded Systems, SIES 2008, Montpellier / La Grande Motte, France, June 11-13, 2008, pp. 200-207, 2008, IEEE, 978-1-4244-1994-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Egon Balas, William Niehaus |
Finding large cliques in arbitrary graphs by bipartite matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 29-51, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
58 | Mark K. Goldberg, Reid D. Rivenburgh |
Constructing cliques using restricted backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 89-101, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
58 | David S. Johnson, Michael A. Trick |
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 1-7, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 524-532, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Knowl. Discov. Data ![In: ACM Trans. Knowl. Discov. Data 2(4), pp. 16:1-16:42, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mining Complex Data ![In: Mining Complex Data, pp. 207-221, 2009, Springer, 978-3-540-88066-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Ikno Kim, Junzo Watada |
Searching Cliques in a Fuzzy Graph Based on an Evolutionary and Biological Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based and Intelligent Information and Engineering Systems, 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part II, pp. 166-173, 2009, Springer, 978-3-642-04591-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Natwar Modani, Kuntal Dey |
Large maximal cliques enumeration in sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 1377-1378, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
filtering, maximal clique |
56 | Robert Bernecky |
Shape cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGAPL APL Quote Quad ![In: ACM SIGAPL APL Quote Quad 35(3), pp. 7-17, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Takeaki Uno |
An Efficient Algorithm for Enumerating Pseudo Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 402-414, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 320-324, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 832-841, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
56 | Kazuhisa Makino, Takeaki Uno |
New Algorithms for Enumerating All Maximal Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 260-272, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(8), pp. 831-837, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 135-144, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 130(1-4), pp. 163-178, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-12, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Sven Kosub |
Local Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Network Analysis ![In: Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004], pp. 112-142, 2004, Springer, 3-540-24979-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 15th International Conference on Pattern Recognition, ICPR'00, Barcelona, Spain, September 3-8, 2000., pp. 1782-1785, 2000, IEEE Computer Society, 0-7695-0750-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(11), pp. 1168-1180, 1989. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2010, Montreal, Quebec, Canada, May 19-20, 2010, Proceedings, pp. 84-88, 2010, ACM, 978-1-60558-901-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
46 | Thomas Wennekers |
On the Natural Hierarchical Composition of Cliques in Cell Assemblies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cogn. Comput. ![In: Cogn. Comput. 1(2), pp. 128-138, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (2) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part II, pp. 33-49, 2008, Springer, 978-3-540-87480-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
46 | A. S. Bavan |
A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCSS (1) ![In: Advances in Computer and Information Sciences and Engineering, Proceedings of the 2007 International Conference on Systems, Computing Sciences and Software Engineering (SCSS), part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE 2007), Bridgeport, CT, USA, December 3-12, 2007, pp. 74-78, 2007, Springer, 978-1-4020-8740-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, Second International Conference, ADMA 2006, Xi'an, China, August 14-16, 2006, Proceedings, pp. 606-617, 2006, Springer, 3-540-37025-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi |
The Worst-Case Time Complexity for Generating All Maximal Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 161-170, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
46 | Yoshiaki Okubo, Makoto Haraguchi |
Creating Abstract Concepts for Classification by Finding Top- N Maximal Weighted Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings, pp. 418-425, 2003, Springer, 3-540-20293-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Serge Fenet, Christine Solnon |
Searching for Maximum Cliques with Ant Colony Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings, pp. 236-245, 2003, Springer, 3-540-00976-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Hiroko Ishii, Hirotsugu Kakugawa |
A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), 13-16 October 2002, Osaka, Japan, pp. 390-395, 2002, IEEE Computer Society, 0-7695-1659-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Feodor F. Dragan, Andreas Brandstädt |
Dominating Cliques in Graphs with Hypertree Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 735-746, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![DIMACS/AMS, 978-0-8218-6609-2 The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
43 | Michael A. Trick |
Appendix: Second DIMACS Challenge test problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 653-657, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan |
Approximately solving Maximum Clique using neural network and related heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 169-204, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Mark Brockington, Joseph C. Culberson |
Camouflaging independent sets in quasi-random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 75-88, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | William M. Spears |
Simulated annealing for hard satisfiability problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 533-557, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Brigitte Jaumard, Mihnea Stan, Jacques Desrosiers |
Tabu search and a quadratic relaxation for the Satisfiability problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 457-477, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Craig A. Morgenstern |
Distributed coloration neighborhood search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 335-357, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Joseph C. Culberson, Feng Luo |
Exploring the k-colorable landscape with Iterated Greedy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 245-284, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos |
A continuous based heuristic for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 103-124, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 395-413, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Tal Grossman |
Applying the INN model to the Maximum Clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 125-145, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Allen Van Gelder, Yumi K. Tsuji |
Satisfiability testing with more reasoning and less guessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 559-586, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 437-455, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Daniele Pretolani |
Efficiency and stability of hypergraph SAT algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 479-498, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Edward C. Sewell |
An improved algorithm for exact graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 359-373, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Mauricio G. C. Resende, Thomas A. Feo |
A GRASP for satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 499-520, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Patrick Soriano, Michel Gendreau |
Tabu search algorithms for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 221-242, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Carlo Mannino, Antonio Sassano |
Edge projection and the maximum cardinality stable set problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 205-219, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 53-73, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Bart Selman, Henry A. Kautz, Bram Cohen |
Local search strategies for satisfiability testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 521-531, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Steven Homer, Marcus Peinado |
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 147-167, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Fred W. Glover, Mark Parker, Jennifer Ryan |
Coloring by tabu branch and bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 285-307, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 619-652, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Yuichi Asahiro, Kazuo Iwama, Eiji Miyano |
Random generation of test instances with controlled attributes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 377-393, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Olivier Dubois 0002, Pascal André, Yacine Boufkhad, Jacques Carlier |
SAT versus UNSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 415-436, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Gary Lewandowski, Anne Condon |
Experiments with parallel graph coloring heuristics and applications of graph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 309-334, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 587-615, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cliques, Coloring, and Satisfiability ![In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993, pp. 11-28, 1993, DIMACS/AMS, 978-0-8218-6609-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings, pp. 298-307, 2008, Springer, 978-3-540-89688-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 459-468, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithm, Interval graph, cliques |
41 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Matching Hierarchical Structures Using Association Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(11), pp. 1105-1120, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: Parallel Processing: CONPAR 94 - VAPP VI, Third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6-8, 1994, Proceedings, pp. 349-358, 1994, Springer, 3-540-58430-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 12th International Conference on Information Visualisation, IV 2008, 8-11 July 2008, London, UK, pp. 415-420, 2008, IEEE Computer Society, 978-0-7695-3268-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 144-155, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 32(2), pp. 13, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005, pp. 453-459, 2005, IEEE Computer Society, 0-7695-2281-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Yanbing Xu, Mostafa I. H. Abd-El-Barr, Carl McCrosky |
Graph-based output phase assignment for PLA minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(5), pp. 613-622, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Sándor P. Fekete, Henk Meijer |
Maximum Dispersion and Geometric Maximum Weight Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 501-511, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Recognition Systems 2 ![In: Computer Recognition Systems 2, pp. 386-393, 2008, Springer, 978-3-540-75174-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Samuel Rota Bulò, Marcello Pelillo |
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LION ![In: Learning and Intelligent Optimization, Second International Conference, LION 2007, Trento, Italy, December 8-12, 2007. Selected Papers, pp. 220-233, 2007, Springer, 978-3-540-92694-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Iwona Cieslik |
On-line coloring and cliques covering for KKs, t-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 42(1), pp. 1-20, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Ioan Tomescu |
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 544-553, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Olivier Pereira, Jean-Jacques Quisquater |
A Security Analysis of the Cliques Protocols Suites. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 11-13 June 2001, Cape Breton, Nova Scotia, Canada, pp. 73-81, 2001, IEEE Computer Society, 0-7695-1146-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Marcello Pelillo |
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMMCVPR ![In: Energy Minimization Methods in Computer Vision and Pattern Recognition, Third International Workshop, EMMCVPR 2001, Sophia Antipolis, France, September 3-5, 2001, Proceedings, pp. 423-437, 2001, Springer, 3-540-42523-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg |
Graph Clustering Using Distance-k Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 98-106, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
31 | Victor Felea |
On Containment of Conjunctive Queries with Negation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADBIS ![In: Advances in Databases and Information Systems, 13th East European Conference, ADBIS 2009, Riga, Latvia, September 7-10, 2009. Proceedings, pp. 206-218, 2009, Springer, 978-3-642-03972-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: HYPERTEXT 2007, Proceedings of the 18th ACM Conference on Hypertext and Hypermedia, September 10-12, 2007, Manchester, UK, pp. 175-178, 2007, ACM, 978-1-59593-820-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005, pp. 736-742, 2005, ACM, 1-59593-135-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 115(1-4), pp. 51-72, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hybrid search, n-queens, maximum cliques, Golomb rulers |
31 | Krisztián Tichler |
Extremal Theorems for Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, Second International Symposium, FoIKS 2002 Salzau Castle, Germany, February 20-23, 2002, Proceedings, pp. 197-211, 2002, Springer, 3-540-43220-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 583-593, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Hannes Moser, Rolf Niedermeier, Manuel Sorge |
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pp. 233-244, 2009, Springer, 978-3-642-02010-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 210-219, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings, pp. 226-239, 2009, Springer, 978-3-642-02157-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Ghazi Al-Naymat |
Enumeration of maximal clique for mining spatial co-location patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: The 6th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2008, Doha, Qatar, March 31 - April 4, 2008, pp. 126-133, 2008, IEEE Computer Society, 978-1-4244-1967-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo |
A Continuous-Based Approach for Partial Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 61-70, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Florian Verhein, Ghazi Al-Naymat |
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 679-684, 2007, IEEE Computer Society, 0-7695-3033-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Haim Kaplan, Micha Sharir, Elad Verbin |
Colored intersection searching via sparse rectangular matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 52-60, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 797-802, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPSN ![In: Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, IPSN 2005, April 25-27, 2005, UCLA, Los Angeles, California, USA, pp. 181-188, 2005, IEEE, 0-7803-9202-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca |
Computing Branchwidth Via Efficient Triangulations and Blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 374-384, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|