Search results for "clique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
24	Andreas Brandstädt, Christian Hundt 0001	Ptolemaic Graphs and Interval Graphs Are Leaf Powers.	LATIN	2008	DBLP DOI BibTeX RDF	and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
24	Li Wan, Jianxin Liao, Xiaomin Zhu 0002	CDPM: Finding and Evaluating Community Structure in Social Networks.	ADMA	2008	DBLP DOI BibTeX RDF	community detection, clique, percolation
24	Adel M. Youssef, Mohamed F. Younis, Moustafa Youssef 0001, Ashok K. Agrawala	On the accuracy of multi-hop relative location estimation in wireless sensor networks.	IWCMC	2007	DBLP DOI BibTeX RDF	CLIQUE factor, multi-hop localization, error analysis
24	Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík	Towards a Robust Biocomputing Solution of Intractable Problems.	DNA	2007	DBLP DOI BibTeX RDF	Incremental Strategy, DNA Computing, NP-Complete problem, Membrane Computing, Maximum Clique Problem
24	Patric R. J. Östergård	Two New Four-Error-Correcting Binary Codes.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	error-correcting code, maximum clique problem
24	Stefanie Gerke, Colin McDiarmid	Channel Assignment with Large Demands.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	graph imperfection, clique-bounds, channel assignment
24	Yasuto Ishitani	Flexible and Robust Model Matching based on Association Graph for Form Image Understanding.	Pattern Anal. Appl.	2000	DBLP BibTeX RDF	Document image analysis, Subgraph isomorphism, Form processing, Model matching, Maximal clique, Association graph
24	Chung Ming Kuo, Chaur-Heh Hsieh, Yong Ren Huang, Zen Sun Lo	A New Mesh-Based Temporal-Spatial Segmentation for Image Sequence.	COMPSAC	2000	DBLP DOI BibTeX RDF	Clique potential, Video segmentation, MAP, Video-object, Gibbs distribution
24	Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko	. Efficient Parallel Algorithms on Distance-Hereditary Graphs.	ICPP	1997	DBLP DOI BibTeX RDF	Steiner tree, PRAM, connected dominating set, clique, distance-hereditary graph
24	Yasuto Ishitani	Model matching based on association graph for form image understanding.	ICDAR	1995	DBLP DOI BibTeX RDF	form image understanding, feature attributes, feature relationships, largest maximal clique, poor quality document images, feature extraction, graph theory, optical character recognition, document image processing, model matching, association graph
24	Levent Onural, M. Bilge Alp, Mehmet Izzet Gürelli	Gibbs Random Field Model Based Weight Selection for the 2-D Adaptive Weighted Median Filter.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	Gibbs random field model based weight selection, 2-D adaptive weighted median filter, generalized filtering method, energy minimisation, 3/spl times/3 square neighborhood structure, clique energies, 3-pixel cliques, 2-pixel cliques, local statistics, filtering and prediction theory, adaptive filters, minimisation, linear filters, two-dimensional digital filters
23	Sarab Almuhaideb, Najwa Altwaijry, Shaha Al-Mansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran	Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem.	Int. J. Appl. Metaheuristic Comput.	2022	DBLP DOI BibTeX RDF
23	Chuan-Min Lee	Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs.	Algorithms	2021	DBLP DOI BibTeX RDF
23	Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko	A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem.	INFORMS J. Comput.	2020	DBLP DOI BibTeX RDF
23	Ui-Hyeop Shin, Hyung-Min Park	Auxiliary-Function-Based Independent Vector Analysis Using Generalized Inter-Clique Dependence Source Models With Clique Variance Estimation.	IEEE Access	2020	DBLP DOI BibTeX RDF
23	Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev	Between clique-width and linear clique-width of bipartite graphs.	Discret. Math.	2020	DBLP DOI BibTeX RDF
23	Hoang Dau, Olgica Milenkovic, Gregory J. Puleo	On the triangle clique cover and Kt clique cover problems.	Discret. Math.	2020	DBLP DOI BibTeX RDF
23	Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna	On clique-inverse graphs of graphs with bounded clique number.	J. Graph Theory	2020	DBLP DOI BibTeX RDF
23	Zuosong Liang, Erfang Shan, Liying Kang	The clique-perfectness and clique-coloring of outer-planar graphs.	J. Comb. Optim.	2019	DBLP DOI BibTeX RDF
23	Pedro Montealegre-Barba	Sequential and distributes graph algorithms. Parameterized algorithms via potential maximal cliques; broadcast congested clique. (Algorithmes de graphes séquentiels et distribués. Algorithmes paramétrés via des cliques maximales potentielles ; Modèle de diffusion dans une clique congestionnée).		2017	RDF
23	Pablo De Caria, Miguel A. Pizaña	On second iterated clique graphs that are also third iterated clique graphs.	Electron. Notes Discret. Math.	2015	DBLP DOI BibTeX RDF
23	Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita	Enumerating Maximal Clique Sets with Pseudo-Clique Constraint.	Discovery Science	2015	DBLP DOI BibTeX RDF
23	Erfang Shan, Zuosong Liang, Liying Kang	Clique-transversal sets and clique-coloring in planar graphs.	Eur. J. Comb.	2014	DBLP DOI BibTeX RDF
23	Daniel Meister 0001, Udi Rotics	Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width.	CoRR	2013	DBLP BibTeX RDF
23	Noriyoshi Sukegawa, Atsushi Miyauchi 0001	A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number.	Discret. Optim.	2013	DBLP DOI BibTeX RDF
23	Qinghua Wu 0002	The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe).		2013	RDF
23	Pablo De Caria	The difference between clique graphs and iterated clique graphs.	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
23	Zuosong Liang, Erfang Shan	Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
23	Pinar Heggernes, Daniel Meister 0001, Udi Rotics	Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.	CSR	2011	DBLP DOI BibTeX RDF
23	Raghavan Rama 0001, Suresh Badarla, Kamala Krithivasan	Clique-Detection Algorithm Using Clique-Self-Assembly.	BIC-TA	2011	DBLP DOI BibTeX RDF
23	Gek Ling Chia, Poh-Hwa Ong	On self-clique graphs with given clique sizes, II.	Discret. Math.	2009	DBLP DOI BibTeX RDF
23	Francisco Larrión, Miguel A. Pizaña	On hereditary clique-Helly self-clique graphs.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
23	Min Chih Lin, Jayme Luiz Szwarcfiter	Faster recognition of clique-Helly and hereditary clique-Helly graphs.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
23	Xiaoyun Ji, John E. Mitchell 0001	Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement.	Discret. Optim.	2007	DBLP DOI BibTeX RDF
23	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Proving NP-hardness for clique-width II: non-approximability of clique-width	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
23	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Proving NP-hardness for clique-width I: non-approximability of sequential clique-width	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
23	Márcia R. Cerioli	Clique Graphs and Edge-clique graphs.	Electron. Notes Discret. Math.	2003	DBLP DOI BibTeX RDF
23	Venkatesan Guruswami, C. Pandu Rangan	Algorithmic aspects of clique-transversal and clique-independent sets.	Discret. Appl. Math.	2000	DBLP DOI BibTeX RDF
23	Gek Ling Chia	On self-clique graphs with given clique sizes.	Discret. Math.	2000	DBLP DOI BibTeX RDF
23	Joan Climent, Antoni Grau, Alberto Sanfeliu	Clique-to-Clique Distance Computation Using a Specific Architecture.	SSPR/SPR	1998	DBLP DOI BibTeX RDF
23	Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan	Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs.	SIAM J. Discret. Math.	1997	DBLP DOI BibTeX RDF
23	V. Balachandran, P. Nagavamsi, C. Pandu Rangan	Clique Transversal and Clique Independence on Comparability Graphs.	Inf. Process. Lett.	1996	DBLP DOI BibTeX RDF
23	Zbigniew Lonc	Clique packings and clique partitions of graphs without odd chordles cycles.	Discuss. Math. Graph Theory	1996	DBLP DOI BibTeX RDF
23	Erich Prisner	Clique Covering and Clique Partition in Generalizations of Line Graphs.	Discret. Appl. Math.	1995	DBLP DOI BibTeX RDF
23	Sean McGuinness	Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K4-Free Graphs.	Comb.	1994	DBLP DOI BibTeX RDF
23	Sean McGuinness, Rolf S. Rees	On the number of distinct minimal clique partitions and clique covers of a line graph.	Discret. Math.	1990	DBLP DOI BibTeX RDF
23	Paul Erdös, Ralph J. Faudree, Edward T. Ordman	Clique partitions and clique coverings.	Discret. Math.	1988	DBLP DOI BibTeX RDF
20	Anna Förster, Amy L. Murphy	CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks.	ICDCS	2009	DBLP DOI BibTeX RDF
20	Deniss Kumlander	An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique.	MCO	2008	DBLP DOI BibTeX RDF
20	Chris H. Q. Ding, Tao Li 0001, Michael I. Jordan	Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding.	ICDM	2008	DBLP DOI BibTeX RDF
20	Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos	Graphs of Linear Clique-Width at Most 3.	TAMC	2008	DBLP DOI BibTeX RDF
20	Pascal Koiran, Klaus Meer	On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.	WG	2008	DBLP DOI BibTeX RDF
20	Jianxin Wang 0001, Zhao Cai, Min Li 0007	An Improved Method Based on Maximal Clique for Predicting Interactions in Protein Interaction Networks.	BMEI (1)	2008	DBLP DOI BibTeX RDF
20	Alexandre P. Francisco, Ricardo Baeza-Yates, Arlindo L. Oliveira	Clique Analysis of Query Log Graphs.	SPIRE	2008	DBLP DOI BibTeX RDF
20	Ghazi Al-Naymat	Enumeration of maximal clique for mining spatial co-location patterns.	AICCSA	2008	DBLP DOI BibTeX RDF
20	Irène Charon, Olivier Hudry	Application of the "descent with mutations" metaheuristic to a clique partitioning problem.	RIVF	2007	DBLP DOI BibTeX RDF
20	Shuichi Watanabe, Junji Kitamichi, Kenichi Kuroda	A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem.	FPL	2007	DBLP DOI BibTeX RDF
20	Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa	Iterated k-Opt Local Search for the Maximum Clique Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
20	Byung-Won On, Ergin Elmacioglu, Dongwon Lee 0001, Jaewoo Kang, Jian Pei	An effective approach to entity resolution problem using quasi-clique and its application to digital libraries.	JCDL	2006	DBLP DOI BibTeX RDF	graph partition, name disambiguation, entity resolution
20	Song Xu, Lixin Shen, Jun Zhai, Zan Yang, Yongxian Li	Research on Virtual Logistic Enterprises Partners Selection Method Based on CLIQUE.	CSCWD	2006	DBLP DOI BibTeX RDF
20	Tammy Toscos, Anne M. Faber, Shunying An, Mona Praful Gandhi	Chick clique: persuasive technology to motivate teenage girls to exercise.	CHI Extended Abstracts	2006	DBLP DOI BibTeX RDF	preventative applications, teenage obesity, persuasive technology, health informatics
20	Wei Gao 0001, Kam-Fai Wong, Yunqing Xia, Ruifeng Xu	Clique Percolation Method for Finding Naturally Cohesive and Overlapping Document Clusters.	ICCPOL	2006	DBLP DOI BibTeX RDF
20	Wei Gao 0001, Kam-Fai Wong	Natural Document Clustering by Clique Percolation in Random Graphs.	AIRS	2006	DBLP DOI BibTeX RDF
20	Pascal Berthomé, Sylvain Lebresne, Kim Nguyen 0001	Computation of Chromatic Polynomials Using Triangulations and Clique Trees.	WG	2005	DBLP DOI BibTeX RDF
20	Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt	Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools.	IPDPS	2005	DBLP DOI BibTeX RDF
20	Martin Marciniszyn, Reto Spöhel, Angelika Steger	The Online Clique Avoidance Game on Random Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
20	Subhash Khot	Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique.	FOCS	2004	DBLP DOI BibTeX RDF
20	Jiahai Wang, Xinshun Xu, Zheng Tang, Weixing Bi, Xiaoming Chen, Yong Li 0003	A New Neural Network Algorithm for Clique Vertex-Partition Problem.	ISNN (1)	2004	DBLP DOI BibTeX RDF
20	Sherin M. Youssef, David G. Elliman	Reactive Prohibition-Based Ant Colony Optimization (RPACO): A New Parallel Architecture for Constrained Clique Sub-Graphs.	ICTAI	2004	DBLP DOI BibTeX RDF
20	John D. Lafferty, Xiaojin Zhu 0001, Yan Liu 0002	Kernel conditional random fields: representation and clique selection.	ICML	2004	DBLP DOI BibTeX RDF
20	Ioan Todinca	Coloring Powers of Graphs of Bounded Clique-Width.	WG	2003	DBLP DOI BibTeX RDF
20	Narong Punnim	The Clique Numbers of Regular Graphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
20	Rodica Boliac, Vadim V. Lozin	On the Clique-Width of Graphs in Hereditary Classes.	ISAAC	2002	DBLP DOI BibTeX RDF
20	Brijnesh J. Jain, Fritz Wysotzki	Fast Winner-Takes-All Networks for the Maximum Clique Problem.	KI	2002	DBLP DOI BibTeX RDF
20	Elena Marchiori	Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
20	Takayuki Nagoya	Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.	ISAAC	2001	DBLP DOI BibTeX RDF
20	Georg Gottlob, Reinhard Pichler	Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.	ICALP	2001	DBLP DOI BibTeX RDF
20	Wolfgang Espelage, Frank Gurski, Egon Wanke	How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.	WG	2001	DBLP DOI BibTeX RDF
20	Wolfgang Espelage, Frank Gurski, Egon Wanke	Deciding Clique-Width for Graphs of Bounded Tree-Width.	WADS	2001	DBLP DOI BibTeX RDF
20	Kazuyuki Amano, Akira Maruoka	A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates.	MFCS	1998	DBLP DOI BibTeX RDF
20	Marcello Pelillo, Immanuel M. Bomze	Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem.	PPSN	1996	DBLP DOI BibTeX RDF
17	Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Pei Xin	Parallel Algorithm for Enumerating Maximal Cliques in Complex Network.	Mining Complex Data	2009	DBLP DOI BibTeX RDF
17	Benjamin Rossman	Ehrenfeucht-Fraïssé Games on Random Structures.	WoLLIC	2009	DBLP DOI BibTeX RDF
17	Ken-ichi Kawarabayashi, Bruce A. Reed	A nearly linear time algorithm for the half integral parity disjoint paths packing problem.	SODA	2009	DBLP DOI BibTeX RDF
17	Kyriaki Ioannidou, Stavros D. Nikolopoulos	Colinear Coloring on Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number
17	Loïc Cerf, Tran Bao Nhan Nguyen, Jean-François Boulicaut	Discovering Relevant Cross-Graph Cliques in Dynamic Networks.	ISMIS	2009	DBLP DOI BibTeX RDF
17	Zhongshan Lin, SeungJin Lim	Optimal candidate generation in spatial co-location mining.	SAC	2009	DBLP DOI BibTeX RDF	co-location mining, spatial data mining, cliqueness
17	Ikno Kim, Junzo Watada	Searching Cliques in a Fuzzy Graph Based on an Evolutionary and Biological Method.	KES (2)	2009	DBLP DOI BibTeX RDF
17	Aurélie Favier, Simon de Givry, Philippe Jégou	Exploiting Problem Structure for Solution Counting.	CP	2009	DBLP DOI BibTeX RDF
17	Immanuel M. Bomze, Marco Locatelli 0001, Fabio Tardella	New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C20, 90C26
17	Henryk Potrzebowski, Jaroslaw Tomasz Stanczak, Krzysztof Sep	Separable Decomposition of Graph Using alpha- cliques.	Computer Recognition Systems 2	2008	DBLP DOI BibTeX RDF
17	Tsung Teng Chen, Liang Chi Hsieh	The Visualization of Relatedness.	IV	2008	DBLP DOI BibTeX RDF
17	Chih-Pin Liao, Jen-Tzung Chien	Graphical modeling of conditional random fields for human motion recognition.	ICASSP	2008	DBLP DOI BibTeX RDF
17	Yichuan Ding, Nathan Krislock, Jiawei Qian, Henry Wolkowicz	Sensor network localization, euclidean distance matrix completions, and graph realization.	MELT	2008	DBLP DOI BibTeX RDF	euclidean distance matrix completions, graph realization, semidefinite programming, anchors, sensor network localization
17	Cheng-Fa Tsai, Chia-Chen Yen	G-TREACLE: A New Grid-Based and Tree-Alike Pattern Clustering Technique for Large Databases.	PAKDD	2008	DBLP DOI BibTeX RDF	hybrid clustering algorithm, data mining, data clustering
17	Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee	Toward Global Minimum through Combined Local Minima.	ECCV (4)	2008	DBLP DOI BibTeX RDF
17	Andrzej Dudek, Vojtech Rödl	New Upper Bound on Vertex Folkman Numbers.	LATIN	2008	DBLP DOI BibTeX RDF	vertex Folkman numbers, Ramsey theory
17	Federico Malucelli, Sara Nicoloso	Shiftable intervals.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Complexity, Optimization problems, Interval graphs
17	Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan	Improved algorithms for weakly chordal graphs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	weakly chordal, graph algorithms, recognition, coloring, Perfect graphs