The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase k-clique (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1972-1979 (15) 1981-1984 (17) 1985-1986 (18) 1987-1988 (17) 1989-1990 (29) 1991 (18) 1992 (22) 1993 (27) 1994 (32) 1995 (26) 1996 (27) 1997 (31) 1998 (40) 1999 (34) 2000 (59) 2001 (78) 2002 (58) 2003 (66) 2004 (108) 2005 (102) 2006 (123) 2007 (130) 2008 (151) 2009 (140) 2010 (76) 2011 (69) 2012 (93) 2013 (96) 2014 (116) 2015 (144) 2016 (128) 2017 (129) 2018 (147) 2019 (123) 2020 (162) 2021 (128) 2022 (145) 2023 (141) 2024 (41)
Publication types (Num. hits)
article(1817) incollection(17) inproceedings(1258) phdthesis(14)
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
151Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter On Clique-Transversals and Clique-Independent Sets. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF clique-independent sets, clique-perfect graphs, clique-transversals, highly clique-imperfect graphs, linear programming, integer linear programming
87Derek G. Corneil, Udi Rotics On the Relationship between Clique-Width and Treewidth. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
79Martin Charles Golumbic, Udi Rotics On the Clique-Width of Perfect Graph Classes. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
77Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider Clique-width minimization is NP-hard. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF absolute approximation, NP-completeness, clique-width, pathwidth
77Torsten Fahle Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF branch-and-bound, constraint programming, maximum clique, cost based filtering
70Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Clique-width: on the price of generality. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
70Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos A Complete Characterisation of the Linear Clique-Width of Path Powers. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
70Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez Clique Graph Recognition Is NP-Complete. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
69Georg Treu, Axel Küpper, Oliver Neukum, Claudia Linnhoff-Popien Efficient clique detection among mobile targets. Search on Bibsonomy Mobility Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique detection, proactive LBSs, mobile computing, location-based services, proximity detection
69Wayne J. Pullan Phased local search for the maximum clique problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Dynamic search, Local search, Maximum clique, Adaptive search
69Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Partitioning, Interval graphs, Sleep mode, Clique-width
69Ingo Schiermeyer Approximating Maximum Independent Set in k-Clique-Free Graphs. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set
67Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri Can Visibility Graphs be Represented Compactly? Search on Bibsonomy SCG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
65Yasuko Matsui, Ryuhei Uehara, Takeaki Uno Enumeration of Perfect Sequences of Chordal Graph. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique tree, perfect sequence, enumeration, Chordal graph
62Luís Cavique, Armando B. Mendes, Jorge M. A. Santos An Algorithm to Discover the k-Clique Cover in Networks. Search on Bibsonomy EPIA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Data mining, social networks, graph mining
62Paul Milbredt, Martin Horauer, Andreas Steininger An investigation of the clique problem in FlexRay. Search on Bibsonomy SIES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
62Dieter Kratsch, Mathieu Liedloff An Exact Algorithm for the Minimum Dominating Clique Problem. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
62Sang-il Oum Approximating Rank-Width and Clique-Width Quickly. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
60Wayne J. Pullan Approximating the maximum vertex/edge weighted clique using local search. Search on Bibsonomy J. Heuristics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Local search, Maximum weighted clique
60Alok Singh 0001, Ashok Kumar Gupta A hybrid heuristic for the maximum clique problem. Search on Bibsonomy J. Heuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Combinatorial optimization, Greedy heuristic, Maximum clique, Steady-state genetic algorithm
57Zvika Brakerski, Boaz Patt-Shamir Distributed discovery of large near-cliques. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF randomized algorithms, communication networks, property testing, clique
57Stephan J. Eidenbenz, Christoph Stamm MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
54Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
54Alexander Glikson, Johann A. Makowsky NCE Graph Grammars and Clique-Width. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
54Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno Matroid Representation of Clique Complexes. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
54Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter Algorithms for finding clique-transversals of graphs. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs
52Dinesh Babu Jayagopi, Hayley Hung, Chuohao Yeo, Daniel Gatica-Perez Predicting the dominant clique in meetings through fusion of nonverbal cues. Search on Bibsonomy ACM Multimedia The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dominance modeling, dominant clique, meetings
52Benjamin Rossman On the constant-depth complexity of k-clique. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits
52Zuosong Liang, Erfang Shan, T. C. Edwin Cheng Clique-Transversal Sets in Cubic Graphs. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Clique-transversal number, Claw-free, Bound, Cubic graph
52Frank Gurski, Egon Wanke The Clique-Width of Tree-Power and Leaf-Power Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers
52Omer Giménez, Petr Hlinený, Marc Noy Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial
52Cyriel Van Nuffelen, Kristel Van Rompay Upper bounds on the independence and the clique covering number. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF clique covering number, eigenvalues, adjacency matrix, independence number
52Rajiv Gupta 0001, Mary Lou Soffa, Denise Ombres Efficient Register Allocation via Coloring Using Clique Separators. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF clique separators, node priorities, graph coloring, spans, spill code, interference graph
47Guo-Hui Lin, Tao Jiang 0001, Paul E. Kearney Phylogenetic k-Root and Steiner k-Root. Search on Bibsonomy ISAAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF graph root, tree power, tree root, critical clique, computational biology, efficient algorithm, phylogeny, maximal clique, Graph power
47Salil Raje, Reinaldo A. Bergamaschi Generalized resource sharing. Search on Bibsonomy ICCAD The full citation details ... 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
45Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos Exact Algorithms for Dominating Clique Problems. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
45Gianpaolo Oriolo, Gautier Stauffer Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C57
45Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo A Continuous-Based Approach for Partial Clique Enumeration. Search on Bibsonomy GbRPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi Efficient inference with cardinality-based clique potentials. Search on Bibsonomy ICML The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin Clique-Width for 4-Vertex Forbidden Subgraphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Mohand Ou Idir Khemmoudj, Hachemi Bennaceur Clique Inference Process for Solving Max-CSP. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin Clique-Width for Four-Vertex Forbidden Subgraphs. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Andreas Brandstädt, Van Bang Le, Suhail Mahfud New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Dibyendu Chakrabarti, Subhamoy Maitra, Bimal K. Roy Clique Size in Sensor Networks with Key Pre-distribution Based on Transversal Design. Search on Bibsonomy IWDC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Fabrizio Grandoni 0001, Giuseppe F. Italiano Decremental Clique Problem. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter Characterization and Recognition of Generalized Clique-Helly Graphs. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Jean-Charles Régin Using Constraint Programming to Solve the Maximum Clique Problem. Search on Bibsonomy CP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
45Günther Bauer 0001, Michael Paulitsch An Investigation of Membership and Clique Avoidance in TTP/C. Search on Bibsonomy SRDS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
45Marisa Gutierrez, João Meidanis On the Clique Operator. Search on Bibsonomy LATIN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
44Malay Bhattacharyya 0001, Sanghamitra Bandyopadhyay Solving maximum fuzzy clique problem with neural networks and its applications. Search on Bibsonomy Memetic Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Maximum fuzzy clique problem, Stock flow graph, Collusion set, Neural networks, Fuzzy logic, Gene expression
44Vadim V. Lozin From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width
44Tanmay De, Ajit Pal, Indranil Sengupta 0001 Routing and Wavelength Assignment in All Optical Networks Based on Clique Partitioning. Search on Bibsonomy ICDCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique partitioning, heuristics, WDM, lightpath, RWA
44Tianming Hu, Hui Xiong 0001, Wenjun Zhou 0001, Sam Yuan Sung, Hangzai Luo Hypergraph partitioning for document clustering: a unified clique perspective. Search on Bibsonomy SIGIR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF shared nearest neighbor, document clustering, clique, hypergraph partitioning
44Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos The densest k-subgraph problem on clique graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Densest k-subgraph, Clique graph, Dynamic programming, Polynomial time approximation scheme
44Pavel Surynek Solving Difficult SAT Instances Using Greedy Clique Decomposition. Search on Bibsonomy SARA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF difficult instances, search, consistency, SAT, clique
44Christine Solnon, Serge Fenet A study of ACO capabilities for solving the maximum clique problem. Search on Bibsonomy J. Heuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Ant colony optimization, Metaheuristic, Maximum clique problem
44David Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction
44Andrea 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 J. Heuristics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF greedy algorithm, adaptive search, maximum clique problem
44Shenshen Gu, Songnian Yu A Chaotic Neural Network for the Maximum Clique Problem. Search on Bibsonomy Canadian AI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Transiently chaotic neural network, Chaos, Hopfield neural network, Chaotic neural network, Maximum clique
44Alberto Bertoni, Paola Campadelli, Giuliano Grossi A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF FPGAs, Combinatorial Optimization, Hopfield networks, Maximum Clique
42Zvika Brakerski, Boaz Patt-Shamir Distributed Discovery of Large Near-Cliques. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Jia Zeng, Zhi-Qiang Liu Markov Random Field-Based Statistical Character Structure Modeling for Handwritten Chinese Character Recognition. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF handwritten Chinese character recognition, statistical-structural character modeling, Markov random fields
42Mauro Brunato, Holger H. Hoos, Roberto Battiti On Effectively Finding Maximal Quasi-cliques in Graphs. Search on Bibsonomy LION The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter On Balanced Graphs. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C50, 05C17, 05C85
42Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan The list partition problem for graphs. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
42Martin Charles Golumbic, Haim Kaplan Cell Flipping in Permutation Diagrams. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
42Stefan Felsner, Rudolf Müller, Lorenz Wernisch Trapezoid Graphs and Generalizations, Geometry and Algorithms. Search on Bibsonomy SWAT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension
42Ton Kloks, Hans L. Bodlaender Testing Superperfection of k-Trees. Search on Bibsonomy SWAT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
40Daxin Jiang, Jian Pei Mining frequent cross-graph quasi-cliques. Search on Bibsonomy ACM Trans. Knowl. Discov. Data The full citation details ... 2009 DBLP  DOI  BibTeX  RDF joint mining, bioinformatics, Graph mining, clique
40Chun-Hua Fu, Yue-Ping Zhou, Xiu-Lian Xu, Hui Chang, Ai-Xia Feng, Jianjun Shi, Da-Ren He Recognition of Important Subgraphs in Collaboration Networks. Search on Bibsonomy Complex (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF shifted power law, bipartite graph, clique, collaboration network, subgraph
40Michael O. Albertson, Debra L. Boutin Automorphisms and Distinguishing Numbers of Geometric Cliques. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Geometric automorphism, Geometric clique, Distinguishing number, Determining set, Convex hull boundary
40Shahriar Tanvir Hasan Murshed, Liaquat Hossain Exploring interaction patterns of cohesive subgroups during organizational disintegration. Search on Bibsonomy CHINZ The full citation details ... 2007 DBLP  DOI  BibTeX  RDF clique analysis, email communications, organisational disintegration, social networks
39Yitzhak Birk, Tomer Kol Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 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
37Afra Zomorodian The tidy set: a minimal simplicial set for computing homology of clique complexes. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF simplicial set, vietoris-rips complex, computational topology, witness complex
37Jyoti Pawar, P. R. Rao An Attribute Based Storage Method for Speeding up CLIQUE Algorithm for Subspace Clustering. Search on Bibsonomy IDEAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
37Aili Han, Daming Zhu A New DNA-Based Approach to Solve the Maximum Weight Clique Problem. Search on Bibsonomy ICIC (3) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
37Peter J. Taillon A New Approach for Solving the Maximum Clique Problem. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
37Christoph Ambühl, Uli Wagner 0001 The Clique Problem in Intersection Graphs of Ellipses and Triangles. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Shin'ichi Wakabayashi, Kenji Kikuchi An Instance-Specific Hardware Algorithm for Finding a Maximum Clique. Search on Bibsonomy FPL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Christoph Ambühl, Uli Wagner 0001 On the Clique Problem in Intersection Graphs of Ellipses. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Bruno Courcelle, Johann A. Makowsky, Udi Rotics Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
37Philippe Galinier, Michel Habib, Christophe Paul Chordal Graphs and Their Clique Graphs. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
37Rajiv Gupta 0001, Mary Lou Soffa, Tim Steele Register Allocation via Clique Separators. Search on Bibsonomy PLDI The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
35Benjamin E. Birnbaum, Kenneth J. Goldman An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Factor-revealing linear programs, Remote-clique, Approximation algorithms, Dispersion
35William 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 KDD Workshop on Knowledge Discovery from Uncertain Data The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph perturbation theory, maximal clique enumeration, graph algorithms, biological applications
35Nicholas Korpelainen, Vadim V. Lozin Bipartite Graphs of Large Clique-Width. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hereditary class, Tree-width, Clique-width
35Sang-il Oum Approximating rank-width and clique-width quickly. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF rank-width, Approximation algorithms, matroids, clique-width, branch-width
35Andrea Grosso, Marco Locatelli 0001, Wayne J. Pullan Simple ingredients leading to very efficient heuristics for the maximum clique problem. Search on Bibsonomy J. Heuristics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Plateau search, Restart rules, Randomness, Maximum clique, Penalties
35Philippe Vismara, Benoît Valéry Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Maximum common subgraph, linegraph, subdivision graph, compatibility graph, constraints satisfaction algorithm, clique detection
35Thierry Vallée, Alain Bretto Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Clique Covering, Network, Graph Theory, Graph Algorithms, Hamiltonicity
35Federico Heras, Javier Larrosa A Max-SAT Inference-Based Pre-processing for Max-Clique. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Max-clique, Inference, Max-SAT
35Igor Dukanovic, Franz Rendl Semidefinite programming relaxations for graph coloring and maximal clique problems. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Lovász theta number, Clique number, Cutting planes, Chromatic number
35Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis Coherent closed quasi-clique discovery from large dense graph databases. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coherent subgraph, quasi-clique, graph mining
35Daniela Ferrarello, Ralf Fröberg The Hilbert Series of the Clique Complex. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Stanley-Reisner ring, Clique complex, Hilbert series, Subgraph polynomial
35Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, Haibo Wang 0001 Clustering of Microarray data via Clique Partitioning. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF clique partitioning, clustering, metaheuristics
35Brenda F. Miles, Vir V. Phoha The bipartite clique: a topological paradigm for WWWeb user search customization. Search on Bibsonomy ACM Southeast Regional Conference (1) The full citation details ... 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
35Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa Solving the maximum clique problem by k-opt local search. Search on Bibsonomy SAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF variable depth search, combinatorial optimization, local search, neighborhood, maximum clique problem
35Daniel Kobler, Udi Rotics Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set
35Wladimir 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 2016   RDF
Displaying result #1 - #100 of 3106 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license