Search results for "k-clique"

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.	Ann. Oper. Res.	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.	WG	2001	DBLP DOI BibTeX RDF
79	Martin Charles Golumbic, Udi Rotics	On the Clique-Width of Perfect Graph Classes.	WG	1999	DBLP DOI BibTeX RDF
77	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Clique-width minimization is NP-hard.	STOC	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.	ESA	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.	SODA	2009	DBLP DOI BibTeX RDF
70	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	A Complete Characterisation of the Linear Clique-Width of Path Powers.	TAMC	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.	WG	2006	DBLP DOI BibTeX RDF
69	Georg Treu, Axel Küpper, Oliver Neukum, Claudia Linnhoff-Popien	Efficient clique detection among mobile targets.	Mobility Conference	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.	J. Comb. Optim.	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.	Algorithmica	1999	DBLP DOI BibTeX RDF	Partitioning, Interval graphs, Sleep mode, Clique-width
69	Ingo Schiermeyer	Approximating Maximum Independent Set in k-Clique-Free Graphs.	APPROX	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?	SCG	1993	DBLP DOI BibTeX RDF
65	Yasuko Matsui, Ryuhei Uehara, Takeaki Uno	Enumeration of Perfect Sequences of Chordal Graph.	ISAAC	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.	EPIA	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.	SIES	2008	DBLP DOI BibTeX RDF
62	Dieter Kratsch, Mathieu Liedloff	An Exact Algorithm for the Minimum Dominating Clique Problem.	IWPEC	2006	DBLP DOI BibTeX RDF
62	Sang-il Oum	Approximating Rank-Width and Clique-Width Quickly.	WG	2005	DBLP DOI BibTeX RDF
60	Wayne J. Pullan	Approximating the maximum vertex/edge weighted clique using local search.	J. Heuristics	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.	J. Heuristics	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.	PODC	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.	IFIP TCS	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.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
54	Alexander Glikson, Johann A. Makowsky	NCE Graph Grammars and Clique-Width.	WG	2003	DBLP DOI BibTeX RDF
54	Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno	Matroid Representation of Clique Complexes.	COCOON	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.	WG	2002	DBLP DOI BibTeX RDF
52	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter	Algorithms for finding clique-transversals of graphs.	Ann. Oper. Res.	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.	ACM Multimedia	2008	DBLP DOI BibTeX RDF	dominance modeling, dominant clique, meetings
52	Benjamin Rossman	On the constant-depth complexity of k-clique.	STOC	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.	ESCAPE	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.	WG	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.	WG	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.	4OR	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.	ACM Trans. Program. Lang. Syst.	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.	ISAAC	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.	ICCAD	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.	ISAAC	2009	DBLP DOI BibTeX RDF
45	Gianpaolo Oriolo, Gautier Stauffer	Clique-circulants and the stable set polytope of fuzzy circular interval graphs.	Math. Program.	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.	GbRPR	2007	DBLP DOI BibTeX RDF
45	Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi	Efficient inference with cardinality-based clique potentials.	ICML	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.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
45	Mohand Ou Idir Khemmoudj, Hachemi Bennaceur	Clique Inference Process for Solving Max-CSP.	CP	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.	FCT	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.	FCT	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.	IWDC	2005	DBLP DOI BibTeX RDF
45	Fabrizio Grandoni 0001, Giuseppe F. Italiano	Decremental Clique Problem.	WG	2004	DBLP DOI BibTeX RDF
45	Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter	Characterization and Recognition of Generalized Clique-Helly Graphs.	WG	2004	DBLP DOI BibTeX RDF
45	Jean-Charles Régin	Using Constraint Programming to Solve the Maximum Clique Problem.	CP	2003	DBLP DOI BibTeX RDF
45	Günther Bauer 0001, Michael Paulitsch	An Investigation of Membership and Clique Avoidance in TTP/C.	SRDS	2000	DBLP DOI BibTeX RDF
45	Marisa Gutierrez, João Meidanis	On the Clique Operator.	LATIN	1998	DBLP DOI BibTeX RDF
44	Malay Bhattacharyya 0001, Sanghamitra Bandyopadhyay	Solving maximum fuzzy clique problem with neural networks and its applications.	Memetic Comput.	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.	ISAAC	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.	ICDCN	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.	SIGIR	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.	J. Comb. Optim.	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.	SARA	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.	J. Heuristics	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.	STOC	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.	J. Heuristics	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.	Canadian AI	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.	Algorithmica	2002	DBLP DOI BibTeX RDF	FPGAs, Combinatorial Optimization, Hopfield networks, Maximum Clique
42	Zvika Brakerski, Boaz Patt-Shamir	Distributed Discovery of Large Near-Cliques.	DISC	2009	DBLP DOI BibTeX RDF
42	Jia Zeng, Zhi-Qiang Liu	Markov Random Field-Based Statistical Character Structure Modeling for Handwritten Chinese Character Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	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.	LION	2007	DBLP DOI BibTeX RDF
42	Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter	On Balanced Graphs.	Math. Program.	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.	SODA	2004	DBLP BibTeX RDF
42	Martin Charles Golumbic, Haim Kaplan	Cell Flipping in Permutation Diagrams.	STACS	1998	DBLP DOI BibTeX RDF
42	Stefan Felsner, Rudolf Müller, Lorenz Wernisch	Trapezoid Graphs and Generalizations, Geometry and Algorithms.	SWAT	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.	SWAT	1992	DBLP DOI BibTeX RDF
40	Daxin Jiang, Jian Pei	Mining frequent cross-graph quasi-cliques.	ACM Trans. Knowl. Discov. Data	2009	DBLP DOI BibTeX RDF	joint mining, bioinformatics, Graph mining, clique
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.	Complex (1)	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.	Discret. Comput. Geom.	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.	CHINZ	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.	IEEE Trans. Inf. Theory	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.	SCG	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.	IDEAS	2006	DBLP DOI BibTeX RDF
37	Aili Han, Daming Zhu	A New DNA-Based Approach to Solve the Maximum Weight Clique Problem.	ICIC (3)	2006	DBLP DOI BibTeX RDF
37	Peter J. Taillon	A New Approach for Solving the Maximum Clique Problem.	AAIM	2006	DBLP DOI BibTeX RDF
37	Christoph Ambühl, Uli Wagner 0001	The Clique Problem in Intersection Graphs of Ellipses and Triangles.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
37	Shin'ichi Wakabayashi, Kenji Kikuchi	An Instance-Specific Hardware Algorithm for Finding a Maximum Clique.	FPL	2004	DBLP DOI BibTeX RDF
37	Christoph Ambühl, Uli Wagner 0001	On the Clique Problem in Intersection Graphs of Ellipses.	ISAAC	2002	DBLP DOI BibTeX RDF
37	Bruno Courcelle, Johann A. Makowsky, Udi Rotics	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.	WG	1998	DBLP DOI BibTeX RDF
37	Philippe Galinier, Michel Habib, Christophe Paul	Chordal Graphs and Their Clique Graphs.	WG	1995	DBLP DOI BibTeX RDF
37	Rajiv Gupta 0001, Mary Lou Soffa, Tim Steele	Register Allocation via Clique Separators.	PLDI	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.	Algorithmica	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.	KDD Workshop on Knowledge Discovery from Uncertain Data	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.	IWOCA	2009	DBLP DOI BibTeX RDF	Hereditary class, Tree-width, Clique-width
35	Sang-il Oum	Approximating rank-width and clique-width quickly.	ACM Trans. Algorithms	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.	J. Heuristics	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.	MCO	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.	ITNG	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.	SAT	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.	Math. Program.	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.	KDD	2006	DBLP DOI BibTeX RDF	coherent subgraph, quasi-clique, graph mining
35	Daniela Ferrarello, Ralf Fröberg	The Hilbert Series of the Clique Complex.	Graphs Comb.	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.	J. Comb. Optim.	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.	ACM Southeast Regional Conference (1)	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.	SAC	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).	SODA	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).		2016	RDF