|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 794 occurrences of 503 keywords
|
|
|
Results
Found 3106 publication records. Showing 3106 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
151 | Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter |
On Clique-Transversals and Clique-Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 116(1-4), pp. 71-77, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
clique-independent sets, clique-perfect graphs, clique-transversals, highly clique-imperfect graphs, linear programming, integer linear programming |
87 | Derek G. Corneil, Udi Rotics |
On the Relationship between Clique-Width and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 78-90, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
79 | Martin Charles Golumbic, Udi Rotics |
On the Clique-Width of Perfect Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 135-147, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
77 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-width minimization is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 354-362, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
absolute approximation, NP-completeness, clique-width, pathwidth |
77 | Torsten Fahle |
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 485-498, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
branch-and-bound, constraint programming, maximum clique, cost based filtering |
70 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 |
Clique-width: on the price of generality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 825-834, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
70 | Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos |
A Complete Characterisation of the Linear Clique-Width of Path Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 241-250, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
70 | Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
Clique Graph Recognition Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 269-277, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Georg Treu, Axel Küpper, Oliver Neukum, Claudia Linnhoff-Popien |
Efficient clique detection among mobile targets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mobility Conference ![In: Proceedings of the 5th International Conference on Mobile Technology, Applications, and Systems, Mobility Conference 2008, Yilan, Taiwan, September 10-12, 2008, pp. 29, 2008, ACM, 978-1-60558-089-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique detection, proactive LBSs, mobile computing, location-based services, proximity detection |
69 | Wayne J. Pullan |
Phased local search for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(3), pp. 303-323, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Dynamic search, Local search, Maximum clique, Adaptive search |
69 | Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh |
Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(3), pp. 187-210, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Partitioning, Interval graphs, Sleep mode, Clique-width |
69 | Ingo Schiermeyer |
Approximating Maximum Independent Set in k-Clique-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 159-168, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set |
67 | Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri |
Can Visibility Graphs be Represented Compactly? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 338-347, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
65 | Yasuko Matsui, Ryuhei Uehara, Takeaki Uno |
Enumeration of Perfect Sequences of Chordal Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 859-870, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique tree, perfect sequence, enumeration, Chordal graph |
62 | Luís Cavique, Armando B. Mendes, Jorge M. A. Santos |
An Algorithm to Discover the k-Clique Cover in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPIA ![In: Progress in Artificial Intelligence, 14th Portuguese Conference on Artificial Intelligence, EPIA 2009, Aveiro, Portugal, October 12-15, 2009. Proceedings, pp. 363-373, 2009, Springer, 978-3-642-04685-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Data mining, social networks, graph mining |
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 |
|
62 | Dieter Kratsch, Mathieu Liedloff |
An Exact Algorithm for the Minimum Dominating Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 130-141, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
62 | Sang-il Oum |
Approximating Rank-Width and Clique-Width Quickly. ![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. 49-58, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
60 | Wayne J. Pullan |
Approximating the maximum vertex/edge weighted clique using local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(2), pp. 117-134, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Local search, Maximum weighted clique |
60 | Alok Singh 0001, Ashok Kumar Gupta |
A hybrid heuristic for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(1-2), pp. 5-22, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, Greedy heuristic, Maximum clique, Steady-state genetic algorithm |
57 | Zvika Brakerski, Boaz Patt-Shamir |
Distributed discovery of large near-cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 324-325, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
randomized algorithms, communication networks, property testing, clique |
57 | Stephan J. Eidenbenz, Christoph Stamm |
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 200-212, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
54 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(5), pp. 623-645, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
54 | Alexander Glikson, Johann A. Makowsky |
NCE Graph Grammars and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 237-248, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
Matroid Representation of Clique Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 192-201, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 57-67, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter |
Algorithms for finding clique-transversals of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 157(1), pp. 37-45, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs |
52 | Dinesh Babu Jayagopi, Hayley Hung, Chuohao Yeo, Daniel Gatica-Perez |
Predicting the dominant clique in meetings through fusion of nonverbal cues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 16th International Conference on Multimedia 2008, Vancouver, British Columbia, Canada, October 26-31, 2008, pp. 809-812, 2008, ACM, 978-1-60558-303-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dominance modeling, dominant clique, meetings |
52 | Benjamin Rossman |
On the constant-depth complexity of k-clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 721-730, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits |
52 | Zuosong Liang, Erfang Shan, T. C. Edwin Cheng |
Clique-Transversal Sets in Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 107-115, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Clique-transversal number, Claw-free, Bound, Cubic graph |
52 | Frank Gurski, Egon Wanke |
The Clique-Width of Tree-Power and Leaf-Power Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 76-85, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers |
52 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. ![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. 59-68, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
52 | Cyriel Van Nuffelen, Kristel Van Rompay |
Upper bounds on the independence and the clique covering number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(1), pp. 43-50, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
clique covering number, eigenvalues, adjacency matrix, independence number |
52 | Rajiv Gupta 0001, Mary Lou Soffa, Denise Ombres |
Efficient Register Allocation via Coloring Using Clique Separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 16(3), pp. 370-386, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
clique separators, node priorities, graph coloring, spans, spill code, interference graph |
47 | Guo-Hui Lin, Tao Jiang 0001, Paul E. Kearney |
Phylogenetic k-Root and Steiner k-Root. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 539-551, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
graph root, tree power, tree root, critical clique, computational biology, efficient algorithm, phylogeny, maximal clique, Graph power |
47 | Salil Raje, Reinaldo A. Bergamaschi |
Generalized resource sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 326-332, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
clique-partitioning-based algorithms, generalized resource sharing, global clique partitioning based framework, interconnect cost estimation, merging cost estimation, sharing possibilities, high level synthesis, high-level synthesis, functional unit, functional units |
45 | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
Exact Algorithms for Dominating Clique Problems. ![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. 4-13, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Gianpaolo Oriolo, Gautier Stauffer |
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 291-317, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57 |
45 | 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 |
|
45 | Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi |
Efficient inference with cardinality-based clique potentials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, pp. 329-336, 2007, ACM, 978-1-59593-793-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for 4-Vertex Forbidden Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(4), pp. 561-590, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Mohand Ou Idir Khemmoudj, Hachemi Bennaceur |
Clique Inference Process for Solving Max-CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 746-750, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for Four-Vertex Forbidden Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 185-196, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Andreas Brandstädt, Van Bang Le, Suhail Mahfud |
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 516-527, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Dibyendu Chakrabarti, Subhamoy Maitra, Bimal K. Roy |
Clique Size in Sensor Networks with Key Pre-distribution Based on Transversal Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWDC ![In: Distributed Computing - IWDC 2005, 7th International Workshop, Kharagpur, India, December 27-30, 2005, Proceedings, pp. 329-337, 2005, Springer, 3-540-30959-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Fabrizio Grandoni 0001, Giuseppe F. Italiano |
Decremental Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 142-153, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter |
Characterization and Recognition of Generalized Clique-Helly Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 344-354, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Jean-Charles Régin |
Using Constraint Programming to Solve the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 634-648, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Günther Bauer 0001, Michael Paulitsch |
An Investigation of Membership and Clique Avoidance in TTP/C. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 19th IEEE Symposium on Reliable Distributed Systems, SRDS'00, Nürnberg, Germany, October 16-18, 2000, Proceedings, pp. 118-124, 2000, IEEE Computer Society, 0-7695-0543-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
45 | Marisa Gutierrez, João Meidanis |
On the Clique Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings, pp. 261-272, 1998, Springer, 3-540-64275-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Malay Bhattacharyya 0001, Sanghamitra Bandyopadhyay |
Solving maximum fuzzy clique problem with neural networks and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memetic Comput. ![In: Memetic Comput. 1(4), pp. 281-290, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Maximum fuzzy clique problem, Stock flow graph, Collusion set, Neural networks, Fuzzy logic, Gene expression |
44 | Vadim V. Lozin |
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 871-882, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width |
44 | Tanmay De, Ajit Pal, Indranil Sengupta 0001 |
Routing and Wavelength Assignment in All Optical Networks Based on Clique Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008., pp. 452-463, 2008, Springer, 978-3-540-77443-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique partitioning, heuristics, WDM, lightpath, RWA |
44 | Tianming Hu, Hui Xiong 0001, Wenjun Zhou 0001, Sam Yuan Sung, Hangzai Luo |
Hypergraph partitioning for document clustering: a unified clique perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2008, Singapore, July 20-24, 2008, pp. 871-872, 2008, ACM, 978-1-60558-164-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
shared nearest neighbor, document clustering, clique, hypergraph partitioning |
44 | Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos |
The densest k-subgraph problem on clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 465-474, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Densest k-subgraph, Clique graph, Dynamic programming, Polynomial time approximation scheme |
44 | Pavel Surynek |
Solving Difficult SAT Instances Using Greedy Clique Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings, pp. 359-374, 2007, Springer, 978-3-540-73579-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
difficult instances, search, consistency, SAT, clique |
44 | Christine Solnon, Serge Fenet |
A study of ACO capabilities for solving the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(3), pp. 155-180, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Ant colony optimization, Metaheuristic, Maximum clique problem |
44 | David Zuckerman |
Linear degree extractors and the inapproximability of max clique and chromatic number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 681-690, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction |
44 | Andrea Grosso, Marco Locatelli 0001, Federico Della Croce |
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 10(2), pp. 135-152, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
greedy algorithm, adaptive search, maximum clique problem |
44 | Shenshen Gu, Songnian Yu |
A Chaotic Neural Network for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Canadian AI ![In: Advances in Artificial Intelligence, 17th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2004, London, Ontario, Canada, May 17-19, 2004, Proceedings, pp. 391-405, 2004, Springer, 3-540-22004-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Transiently chaotic neural network, Chaos, Hopfield neural network, Chaotic neural network, Maximum clique |
44 | Alberto Bertoni, Paola Campadelli, Giuliano Grossi |
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(1), pp. 71-88, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
FPGAs, Combinatorial Optimization, Hopfield networks, Maximum Clique |
42 | Zvika Brakerski, Boaz Patt-Shamir |
Distributed Discovery of Large Near-Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 206-220, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Jia Zeng, Zhi-Qiang Liu |
Markov Random Field-Based Statistical Character Structure Modeling for Handwritten Chinese Character Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 30(5), pp. 767-780, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
handwritten Chinese character recognition, statistical-structural character modeling, Markov random fields |
42 | Mauro Brunato, Holger H. Hoos, Roberto Battiti |
On Effectively Finding Maximal Quasi-cliques in Graphs. ![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. 41-55, 2007, Springer, 978-3-540-92694-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter |
On Balanced Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 233-250, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C50, 05C17, 05C85 |
42 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The list partition problem for graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 391-399, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
42 | Martin Charles Golumbic, Haim Kaplan |
Cell Flipping in Permutation Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 577-586, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Stefan Felsner, Rudolf Müller, Lorenz Wernisch |
Trapezoid Graphs and Generalizations, Geometry and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 143-154, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension |
42 | Ton Kloks, Hans L. Bodlaender |
Testing Superperfection of k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 292-303, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
40 | 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 |
40 | 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 |
40 | Michael O. Albertson, Debra L. Boutin |
Automorphisms and Distinguishing Numbers of Geometric Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(4), pp. 778-785, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Geometric automorphism, Geometric clique, Distinguishing number, Determining set, Convex hull boundary |
40 | Shahriar Tanvir Hasan Murshed, Liaquat Hossain |
Exploring interaction patterns of cohesive subgroups during organizational disintegration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHINZ ![In: Proceedings of the 8th ACM SIGCHI New Zealand Chapter's International Conference on Computer-Human Interaction: Design Centered HCI, 2007, Hamilton, New Zealand, July 1-4, 2007, pp. 59-66, 2007, ACM, 978-1-59593-836-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
clique analysis, email communications, organisational disintegration, social networks |
39 | Yitzhak Birk, Tomer Kol |
Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2825-2830, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k-partial clique, caching clients, clique cover, informed-Source Coding On Demand (ISCOD), multicast, error-correcting codes, communication complexity, information dissemination, maximum matching |
37 | Afra Zomorodian |
The tidy set: a minimal simplicial set for computing homology of clique complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 257-266, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
simplicial set, vietoris-rips complex, computational topology, witness complex |
37 | Jyoti Pawar, P. R. Rao |
An Attribute Based Storage Method for Speeding up CLIQUE Algorithm for Subspace Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: Tenth International Database Engineering and Applications Symposium (IDEAS 2006), 11-14 December 2006, Delhi, India, pp. 309-310, 2006, IEEE Computer Society, 0-7695-2577-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
37 | Aili Han, Daming Zhu |
A New DNA-Based Approach to Solve the Maximum Weight Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Computational Intelligence and Bioinformatics, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part III, pp. 320-327, 2006, Springer, 3-540-37277-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
37 | Peter J. Taillon |
A New Approach for Solving the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 279-290, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
37 | Christoph Ambühl, Uli Wagner 0001 |
The Clique Problem in Intersection Graphs of Ellipses and Triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(3), pp. 279-292, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Shin'ichi Wakabayashi, Kenji Kikuchi |
An Instance-Specific Hardware Algorithm for Finding a Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: Field Programmable Logic and Application, 14th International Conference , FPL 2004, Leuven, Belgium, August 30-September 1, 2004, Proceedings, pp. 516-525, 2004, Springer, 3-540-22989-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Christoph Ambühl, Uli Wagner 0001 |
On the Clique Problem in Intersection Graphs of Ellipses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 489-500, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 1-16, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
37 | Philippe Galinier, Michel Habib, Christophe Paul |
Chordal Graphs and Their Clique Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 358-371, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
37 | Rajiv Gupta 0001, Mary Lou Soffa, Tim Steele |
Register Allocation via Clique Separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI), Portland, Oregon, USA, June 21-23, 1989, pp. 264-274, 1989, ACM, 0-89791-306-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
35 | Benjamin E. Birnbaum, Kenneth J. Goldman |
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 42-59, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Factor-revealing linear programs, Remote-clique, Approximation algorithms, Dispersion |
35 | William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova |
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD Workshop on Knowledge Discovery from Uncertain Data ![In: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, Paris, France, June 28, 2009, pp. 48-56, 2009, ACM, 978-1-60558-675-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
graph perturbation theory, maximal clique enumeration, graph algorithms, biological applications |
35 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite Graphs of Large Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 385-395, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hereditary class, Tree-width, Clique-width |
35 | Sang-il Oum |
Approximating rank-width and clique-width quickly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 10:1-10:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
rank-width, Approximation algorithms, matroids, clique-width, branch-width |
35 | Andrea Grosso, Marco Locatelli 0001, Wayne J. Pullan |
Simple ingredients leading to very efficient heuristics for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(6), pp. 587-612, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Plateau search, Restart rules, Randomness, Maximum clique, Penalties |
35 | Philippe Vismara, Benoît Valéry |
Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 358-368, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Maximum common subgraph, linegraph, subdivision graph, compatibility graph, constraints satisfaction algorithm, clique detection |
35 | Thierry Vallée, Alain Bretto |
Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fifth International Conference on Information Technology: New Generations (ITNG 2008), 7-8 April 2008, Las Vegas, Nevada, USA, pp. 904-909, 2008, IEEE Computer Society, 978-0-7695-3099-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Clique Covering, Network, Graph Theory, Graph Algorithms, Hamiltonicity |
35 | Federico Heras, Javier Larrosa |
A Max-SAT Inference-Based Pre-processing for Max-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, pp. 139-152, 2008, Springer, 978-3-540-79718-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Max-clique, Inference, Max-SAT |
35 | Igor Dukanovic, Franz Rendl |
Semidefinite programming relaxations for graph coloring and maximal clique problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 109(2-3), pp. 345-365, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Lovász theta number, Clique number, Cutting planes, Chromatic number |
35 | 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 |
35 | Daniela Ferrarello, Ralf Fröberg |
The Hilbert Series of the Clique Complex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(4), pp. 401-405, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Stanley-Reisner ring, Clique complex, Hilbert series, Subgraph polynomial |
35 | Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, Haibo Wang 0001 |
Clustering of Microarray data via Clique Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(1), pp. 77-92, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
clique partitioning, clustering, metaheuristics |
35 | Brenda F. Miles, Vir V. Phoha |
The bipartite clique: a topological paradigm for WWWeb user search customization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference (1) ![In: Proceedings of the 43nd Annual Southeast Regional Conference, 2005, Kennesaw, Georgia, USA, March 18-20, 2005, Volume 1, pp. 90-95, 2005, ACM, 1-59593-059-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bipartite clique or biclique graph, combined log format, web neighborhood, web user customization, web user search, link analysis, web usage mining, web structure mining |
35 | Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa |
Solving the maximum clique problem by k-opt local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pp. 1021-1025, 2004, ACM, 1-58113-812-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
variable depth search, combinatorial optimization, local search, neighborhood, maximum clique problem |
35 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 468-476, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
35 | Wladimir Araujo Tavares |
Algoritmos exatos para problema da clique maxima ponderada. (Exact algorithms for the maximum-weight clique problem / Algorithmes pour le problème de la clique de poids maximum). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2016 |
RDF |
|
Displaying result #1 - #100 of 3106 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|