Search results for "clique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
35	Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez	On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
35	Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez	On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.	Electron. Notes Discret. Math.	2008	DBLP DOI BibTeX RDF
34	Sonal Patel, Eric Harley	Estimation of the number of cliques in a random graph.	C3S2E	2010	DBLP DOI BibTeX RDF
34	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
34	Bruno Courcelle, Mamadou Moustapha Kanté	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.	WG	2007	DBLP DOI BibTeX RDF
34	Oliver J. Woodford, Ian D. Reid 0001, Andrew W. Fitzgibbon	Efficient new-view synthesis using pairwise dictionary priors.	CVPR	2007	DBLP DOI BibTeX RDF
34	Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou	CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases.	ICDE	2006	DBLP DOI BibTeX RDF
34	Christophe Paul, Jan Arne Telle	New Tools and Simpler Algorithms for Branchwidth.	ESA	2005	DBLP DOI BibTeX RDF
34	Serge Fenet, Christine Solnon	Searching for Maximum Cliques with Ant Colony Optimization.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
32	Xiangang Cheng, Liang-Tien Chia	Stratification-based keyframe cliques for removal of near-duplicates in video search results.	Multimedia Information Retrieval	2010	DBLP DOI BibTeX RDF	quasi-clique, stratification-based, web video, near-duplicate
32	Natwar Modani, Kuntal Dey	Large maximal cliques enumeration in sparse graphs.	CIKM	2008	DBLP DOI BibTeX RDF	filtering, maximal clique
32	Chunfang Zheng, Qian Zhu 0002, David Sankoff	Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	rice, sorghum, synteny blocks, genome rearrangements, Maximum Weight Clique
32	Wilfried Steiner, Michael Paulitsch, Hermann Kopetz	The TTA's Approach to Resilience after Transient Upsets.	Real Time Syst.	2006	DBLP DOI BibTeX RDF	multiple failures, clique resolving, startup, self stabilization, recovery, Time-Triggered Architecture
32	Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov	Novel Approaches for Analyzing Biological Networks.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	n-cliques, n-clubs, clique relaxations, social networks, biological networks
32	Andreas Brandstädt	On Robust Algorithms for the Maximum Weight Stable Set Problem.	FCT	2001	DBLP DOI BibTeX RDF	Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
32	Jayaram Bhasker, Tariq Samad	Compacting MIMOLA microcode.	MICRO	1987	DBLP DOI BibTeX RDF	clique partitioning, synthesis, compaction, microprogramming
30	Katarzyna Musial, Krzysztof Juszczyszyn	Properties of Bridge Nodes in Social Networks.	ICCCI	2009	DBLP DOI BibTeX RDF	bridging node, regular clique, peripheral node, peripheral clique, social position
28	Ziyu Chen, Zhongshi He, Cheng Zhang	The non-clique particle swarm optimizer.	GEC Summit	2009	DBLP DOI BibTeX RDF	neighborhood topology, graph theory, particle swarm optimization
28	Lorenz Minder, Dan Vilenchik	Small Clique Detection and Approximate Nash Equilibria.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
28	Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung	Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C69
28	Parthasarathy Guturu, Ram Dantu	An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding.	IEEE Trans. Syst. Man Cybern. Part B	2008	DBLP DOI BibTeX RDF
28	Deniss Kumlander	On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes.	MCO	2008	DBLP DOI BibTeX RDF
28	Patryk Mazurkiewicz, Kin K. Leung	Clique-Based Location Estimations for Wireless Sensors in GPS-Free Environments.	ICCCN	2008	DBLP DOI BibTeX RDF
28	Lixin Gan, Shengqian Wang, Mingwen Wang, Zhihua Xie, Lin Zhang, Zhenghua Shu	Query Expansion based on Concept Clique for Markov Network Information Retrieval Model.	FSKD (5)	2008	DBLP DOI BibTeX RDF
28	Jan Obdrzálek	Clique-Width and Parity Games.	CSL	2007	DBLP DOI BibTeX RDF
28	Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin	Computing Graph Polynomials on Graphs of Bounded Clique-Width.	WG	2006	DBLP DOI BibTeX RDF
28	Benjamin E. Birnbaum, Kenneth J. Goldman	An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
28	Jianbo Li, Mingxia Chen, Jianping Li 0007, Weidong Li 0002	Minimum Clique Partition Problem with Constrained Weight for Interval Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	approximation algorithm, Interval graph, cliques
28	Qingfu Zhang 0001, Jianyong Sun, Edward P. K. Tsang	An evolutionary algorithm with guided mutation for the maximum clique problem.	IEEE Trans. Evol. Comput.	2005	DBLP DOI BibTeX RDF
28	Ben Green 0001	Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 11B75
28	Feodor F. Dragan, Chenyu Yan	Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.	ISAAC	2005	DBLP DOI BibTeX RDF
28	Andreas Brandstädt, Chính T. Hoàng	On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.	IPCO	2005	DBLP DOI BibTeX RDF
28	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
28	Etsuji Tomita, Tomokazu Seki	An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.	DMTCS	2003	DBLP DOI BibTeX RDF
28	Bruno Richard 0002, Donal Mac Nioclais, Denis Chalon	Clique: A Transparent, Peer-to-Peer Replicated File System.	Mobile Data Management	2003	DBLP DOI BibTeX RDF
28	Raffaele Mosca	A Property About Minimum Edge- and Minimum Clique-Cover of a Graph.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
28	Lars Engebretsen, Jonas Holmerin	Clique Is Hard to Approximate within n1-o(1).	ICALP	2000	DBLP DOI BibTeX RDF
28	Frank Gurski, Egon Wanke	The Tree-Width of Clique-Width Bounded Graphs Without Kn, n.	WG	2000	DBLP DOI BibTeX RDF
28	Arun Jagota, Marcello Pelillo, Anand Rangarajan 0001	A New Deterministic Annealing Algorithm for Maximum Clique.	IJCNN (6)	2000	DBLP DOI BibTeX RDF
28	Antonella Branca, Ettore Stella, Arcangelo Distante	Feature Matching by Searching Maximum Clique on High Order Association Graph.	ICIAP	1999	DBLP DOI BibTeX RDF
28	Joshua Alspector, Aleksander Kolcz, Nachimuthu Karunanithi	Feature-based and Clique-based User Models for Movie Selection: A Comparative Study.	User Model. User Adapt. Interact.	1997	DBLP DOI BibTeX RDF	neural networks, feature extraction, collaborative filtering, User modeling, information filtering, bagging, linear models, CART, regression trees
28	Robert D. Carr	Separating Clique Tree and Bipartition Inequalities in Polynominal Time.	IPCO	1995	DBLP DOI BibTeX RDF
28	Ingo Wegener	On the complexity of branching programs and decision trees for clique functions.	J. ACM	1988	DBLP DOI BibTeX RDF
28	Ingo Wegener	On the Complexity of Branching Programs and Decision Trees for Clique Functions.	TAPSOFT, Vol.1	1987	DBLP DOI BibTeX RDF
27	Fatih Özgül, Zeki Erdem, Chris Bowerman, Claus Atzenbeck	Comparison of Feature-Based Criminal Network Detection Models with k-Core and n-Clique.	ASONAM	2010	DBLP DOI BibTeX RDF	criminal networks, k-core, n-clique, detection
27	Marcello Pelillo	Heuristics for Maximum Clique and Independent Set.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Algorithms, Heuristics, Independent set, Clique
27	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Data reduction and exact algorithms for clique cover.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Clique cover, data reduction, fixed-parameter tractability
27	Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis	Out-of-core coherent closed quasi-clique mining from large dense graph databases.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	coherent subgraph, frequent closed subgraph, quasi-clique, Graph mining, out-of-core algorithm
27	Daniel P. Fasulo, Anne-Katrin Emde, Lu-Yong Wang, Karin Noy, Nathan Edwards	Alignment of Mass Spectrometry Data by Clique Finding and Optimization.	Systems Biology and Computational Proteomics	2006	DBLP DOI BibTeX RDF	bounded error model, clique finding, alignment, mass spectrometry
27	Aravind Srinivasan	The value of strong inapproximability results for clique.	STOC	2000	DBLP DOI BibTeX RDF	P vs. NP, inapproximabilit, packing integer programs, approximation algorithms, random sampling, independent set, clique
27	Elena Marchiori	A simple heuristic based genetic algorithm for the maximum clique problem.	SAC	1998	DBLP DOI BibTeX RDF	genetic algorithm, combinatorial optimization, heuristic algorithm, maximum clique problem
27	Johan Håstad	Clique is Hard to Approximate Within n1-epsilon.	FOCS	1996	DBLP DOI BibTeX RDF	Max Clique approximation, amortized free bits, global function, local functions, local consistency conditions, computational complexity, polynomial time, proof system
27	Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy	Approximating Clique is Almost NP-Complete (Preliminary Version)	FOCS	1991	DBLP DOI BibTeX RDF	approximation procedures, approximating clique, almost NP-complete, computational complexity, graph
25	Kazumi Saito, Takeshi Yamada, Kazuhiro Kazama	The k-Dense Method to Extract Communities from Complex Networks.	Mining Complex Data	2009	DBLP DOI BibTeX RDF
25	Elad Hazan, Robert Krauthgamer	How hard is it to approximate the best Nash equilibrium?	SODA	2009	DBLP DOI BibTeX RDF
25	N. S. Narayanaswamy, R. Subhash Babu	A Note on First-Fit Coloring of Interval Graphs.	Order	2008	DBLP DOI BibTeX RDF	First fit for online graph coloring, Column construction method, Competitive analysis
25	Michael ten Caat, Natasha M. Maurits, Jos B. T. M. Roerdink	Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units.	IEEE Trans. Vis. Comput. Graph.	2008	DBLP DOI BibTeX RDF
25	Jia Zeng, Zhi-Qiang Liu	Type-2 Fuzzy Markov Random Fields and Their Application to Handwritten Chinese Character Recognition.	IEEE Trans. Fuzzy Syst.	2008	DBLP DOI BibTeX RDF
25	Andrea Asperti	The intensional content of Rice's theorem.	POPL	2008	DBLP DOI BibTeX RDF	complexity, computability, recursion theory
25	Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond	Clustering with Partial Information.	MFCS	2008	DBLP DOI BibTeX RDF
25	Yuzhou Zhang, Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou	Parallel mining of closed quasi-cliques.	IPDPS	2008	DBLP DOI BibTeX RDF
25	Dongjoe Shin, Tardi Tjahjadi	Similarity Invariant Delaunay Graph Matching.	SSPR/SPR	2008	DBLP DOI BibTeX RDF	Delaunay tessellation, Similarity invariant distance, Hausdorff distance, Point pattern matching
25	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT using vertex covers.	Acta Informatica	2007	DBLP DOI BibTeX RDF
25	Takeaki Uno	An Efficient Algorithm for Enumerating Pseudo Cliques.	ISAAC	2007	DBLP DOI BibTeX RDF
25	Bruno Courcelle, Andrew Twigg	Compact Forbidden-Set Routing.	STACS	2007	DBLP DOI BibTeX RDF	Algorithms, compact routing, labelling schemes
25	Bin Wu 0001, Xin Pei	A Parallel Algorithm for Enumerating All the Maximal k -Plexes.	PAKDD Workshops	2007	DBLP DOI BibTeX RDF
25	Shishir Nagaraja, Ross J. Anderson	Dynamic Topologies for Robust Scale-Free Networks.	BIOWIRE	2007	DBLP DOI BibTeX RDF	covert groups, security, robustness, topology, Scale-free networks
25	Arnaud Pêcher, Annegret Wagler	Almost all webs are not rank-perfect.	Math. Program.	2006	DBLP DOI BibTeX RDF	Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web
25	Jorge A. Navas, Francisco Bueno, Manuel V. Hermenegildo	Efficient Top-Down Set-Sharing Analysis Using Cliques.	PADL	2006	DBLP DOI BibTeX RDF
25	Kazumi Saito, Takeshi Yamada	Extracting Communities from Complex Networks by the k-dense Method.	ICDM Workshops	2006	DBLP DOI BibTeX RDF
25	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
25	Aili Han, Daming Zhu	Complexity Analysis for the HEWN Algorithm.	ISDA (1)	2006	DBLP DOI BibTeX RDF
25	Hongqiang Zhai, Yuguang Fang	Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks.	ICNP	2006	DBLP DOI BibTeX RDF
25	Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan	Automatic Subspace Clustering of High Dimensional Data.	Data Min. Knowl. Discov.	2005	DBLP DOI BibTeX RDF	clustering, dimensionality reduction, subspace clustering
25	Hailong Yao, Yici Cai, Qiang Zhou 0001, Xianlong Hong	Crosstalk-Aware Routing Resource Assignment.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	track/layer assignment, routing, VLSI, interconnect, physical design, crosstalk
25	Frank Gurski, Egon Wanke	Minimizing NLC-Width is NP-Complete.	WG	2005	DBLP DOI BibTeX RDF
25	Andrew R. Willis, Jasper Speicher, David B. Cooper	Surface Sculpting with Stochastic Deformable 3D Surfaces.	ICPR (2)	2004	DBLP DOI BibTeX RDF
25	Benny Chor, Mike Fellows, David W. Juedes	Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps.	WG	2004	DBLP DOI BibTeX RDF
25	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	Linear FPT reductions and computational lower bounds.	STOC	2004	DBLP DOI BibTeX RDF	lower bound, complexity theory, NP-hard problems
25	Sing-Hoi Sze, Songjian Lu, Jianer Chen	Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding.	WABI	2004	DBLP DOI BibTeX RDF
25	Raffaele Mosca	A Shy Invariant of Graphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
25	Adrian Dumitrescu, Géza Tóth 0001	Ramsey-Type Results for Unions of Comparability Graphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
25	Ahmed Bouajjani, Agathe Merceron	Parametric Verification of a Group Membership Algorithm.	FTRTFT	2002	DBLP DOI BibTeX RDF	parametric counter automata, Formal verification, abstraction, fault-tolerant protocols
25	Roberto Montemanni, D. H. Smith, Stuart M. Allen	Lower Bounds for Fixed Spectrum Frequency Assignment.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	radio frequency assignment, fixed spectrum problems, lower bounds
25	Vijay Raghavan 0002, Jeremy P. Spinrad	Robust algorithms for restricted domains.	SODA	2001	DBLP BibTeX RDF
25	Shawn Grant, Gordon I. McCalla	A Hybrid Approach to Making Recommendations and Its Application to the Movie Domain.	AI	2001	DBLP DOI BibTeX RDF
25	Danny van Noort, Frank-Ulrich Gast, John S. McCaskill	DNA Computing in Microreactors.	DNA	2001	DBLP DOI BibTeX RDF
25	Albert Atserias, Nicola Galesi, Ricard Gavaldà	Monotone Proofs of the Pigeon Hole Principle.	ICALP	2000	DBLP DOI BibTeX RDF
25	Tomás Feder, Pavol Hell, Jing Huang 0007	List Homomorphisms and Circular Arc Graphs.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75
25	Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker	Attributed Tree Matching and Maximum Weight Cliques.	ICIAP	1999	DBLP DOI BibTeX RDF
25	Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.	SIGMOD Conference	1998	DBLP DOI BibTeX RDF
25	D. L. Springer, Donald E. Thomas	Exploiting the special structure of conflict and compatibility graphs in high-level synthesis.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
25	Feodor F. Dragan, Andreas Brandstädt	Dominating Cliques in Graphs with Hypertree Structures.	STACS	1994	DBLP DOI BibTeX RDF
25	Angelika Zobel	Program structure as basis for parallelizing global register allocation.	ICCL	1992	DBLP DOI BibTeX RDF
25	Lin Chen 0001	Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs.	ICCI	1991	DBLP DOI BibTeX RDF
24	James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu	Finding maximal cliques in massive networks by H*-graph.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	h*-graph, massive networks, maximal clique enumeration, scale-free networks, h-index
24	Samuel Rota Bulò, Marcello Pelillo	A generalization of the Motzkin-Straus theorem to hypergraphs.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Polynomial optimization, Hypergraphs, Maximum clique
24	Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo	Parallel shared memory strategies for ant-based optimization algorithms.	GECCO	2009	DBLP DOI BibTeX RDF	Max Clique, ant-based algorithms, MPI, shared memory, OpenMP, distributed memory
24	Deyong Hu, Bin Wu 0001, Qi Ye, Bai Wang 0001	Structure Correlation in Mobile Call Networks.	ADMA	2009	DBLP DOI BibTeX RDF	Clique Size Vector, Visualization, Social Network, Correlation, Anomaly, Structural Property
24	Louis Ibarra	Fully dynamic algorithms for chordal graphs and split graphs.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	clique trees, split graphs, chordal graphs, Dynamic graph algorithms