Search results for "clique"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Irena Penev	On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
12	A. Arciprete, Vincenza Carchiolo, D. Chiavetta, Marco Grassia, Michele Malgeri, Giuseppe Mangioni	Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms.	COMPLEX NETWORKS (1)	2022	DBLP DOI BibTeX RDF
12	Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl	Locally Checkable Problems Parameterized by Clique-Width.	ISAAC	2022	DBLP DOI BibTeX RDF
12	Kazuho Kanahara, Shun Ito, Kengo Katayama	The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem.	ICCCM	2022	DBLP DOI BibTeX RDF
12	Xinrui Zhang, Qin Wang 0008, Rujia Li, Qi Wang 0012	Frontrunning Block Attack in PoA Clique: A Case Study.	ICBC	2022	DBLP DOI BibTeX RDF
12	Antares Chen, Jonathan Shi, Luca Trevisan	Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification.	SODA	2022	DBLP DOI BibTeX RDF
12	Zhirong Yuan, You Peng, Peng Cheng 0003, Li Han 0001, Xuemin Lin 0001, Lei Chen 0002, Wenjie Zhang 0001	Efficient $k-\text{clique}$ Listing with Set Intersection Speedup.	ICDE	2022	DBLP DOI BibTeX RDF
12	Minjia Pan, Rong-Hua Li, Qi Zhang 0010, Yongheng Dai, Qun Tian, Guoren Wang	Fairness-aware Maximal Clique Enumeration.	ICDE	2022	DBLP DOI BibTeX RDF
12	Chen Chen 0017, Yanping Wu, Renjie Sun, Xiaoyang Wang 0002	Maximum Signed $\theta$-Clique Identification in Large Signed Graphs (Extended abstract).	ICDE	2022	DBLP DOI BibTeX RDF
12	Guimu Guo, Da Yan 0001, Lyuheng Yuan, Jalal Khalil, Cheng Long, Zhe Jiang 0001, Yang Zhou 0001	Maximal Directed Quasi -Clique Mining.	ICDE	2022	DBLP DOI BibTeX RDF
12	Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongzhi Chen, Guoren Wang	Lightning Fast and Space Efficient k-clique Counting.	WWW	2022	DBLP DOI BibTeX RDF
12	Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad 0001	Quasi-Clique Mining for Graph Summarization.	DEXA (2)	2022	DBLP DOI BibTeX RDF
12	Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang	On Lower Bounds of Approximating Parameterized k-Clique.	ICALP	2022	DBLP DOI BibTeX RDF
12	Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.	ICALP	2022	DBLP DOI BibTeX RDF
12	Connor Beck, Anja Kunze, Dominique Zosso	Archetypal Analysis for neuronal clique detection in low-rate calcium fluorescence imaging.	EMBC	2022	DBLP DOI BibTeX RDF
12	Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Hongzhi Chen, Guoren Wang	Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach.	SIGMOD Conference	2022	DBLP DOI BibTeX RDF
12	John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev	Byzantine Connectivity Testing in the Congested Clique.	DISC	2022	DBLP DOI BibTeX RDF
12	Jian Gao 0007, Zhenghang Xu, Ruizhi Li, Minghao Yin	An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs.	AAAI	2022	DBLP DOI BibTeX RDF
12	Jun Wu 0020, Minghao Yin	A Hybrid Evolutionary Algorithm for the Diversified Top-k Weight Clique Search Problem (Student Abstract).	AAAI	2022	DBLP DOI BibTeX RDF
12	Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam	Fault-Tolerant Graph Realizations in the Congested Clique.	ALGOSENSORS	2022	DBLP DOI BibTeX RDF
12	Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-Mei Hwu	Parallel K-clique counting on GPUs.	ICS	2022	DBLP DOI BibTeX RDF
12	Ali Baran Tasdemir, Tuna Karacan, Emir Kaan Kirmaci, Lale Özkahya	Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations.	CSoNet	2022	DBLP DOI BibTeX RDF
12	Sebastian Forster, Tijn de Vos	The Laplacian Paradigm in the Broadcast Congested Clique.	PODC	2022	DBLP DOI BibTeX RDF
12	Shiri Chechik, Tianyi Zhang 0008	Constant-Round Near-Optimal Spanners in Congested Clique.	PODC	2022	DBLP DOI BibTeX RDF
12	Sujoy Bhore, Fabian Klute, Jelle J. Oostveen	On Streaming Algorithms for Geometric Independent Set and Clique.	WAOA	2022	DBLP DOI BibTeX RDF
12	Felicia Lucke, Felix Mann	Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number.	IWOCA	2022	DBLP DOI BibTeX RDF
12	Soumen Nandi, Sagnik Sen 0001, S. Taruni	On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs.	IWOCA	2022	DBLP DOI BibTeX RDF
12	Ziliang Zhang, Yunxiang Ge, Weibei Dou	Clique Network-Based Statistics for Detecting Altered Topological Structures in the Brain Network.	BIBM	2022	DBLP DOI BibTeX RDF
12	Darren Strash, Louise Thompson	Effective Data Reduction for the Vertex Clique Cover Problem.	ALENEX	2022	DBLP DOI BibTeX RDF
12	Takuya Noguchi, Akihiro Fujiwara	An asynchronous P system for solving the maximum clique problem with the Bron-Kerbosch algorithm.	CANDARW	2022	DBLP DOI BibTeX RDF
12	Kei Ikebe, Kouichi Sakurai	Analysis of Variance of Searching Time for Serial Concatenation of Graph-Clique based Cryptocurrency Mining.	CANDARW	2022	DBLP DOI BibTeX RDF
12	Alexander Belyi, Stanislav Sobolevsky	Network Size Reduction Preserving Optimal Modularity and Clique Partition.	ICCSA (1)	2022	DBLP DOI BibTeX RDF
12	Yimeng Min, Frederik Wenkel, Michael Perlmutter, Guy Wolf	Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?	NeurIPS	2022	DBLP BibTeX RDF
12	Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi	How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF.	IJCNN	2022	DBLP DOI BibTeX RDF
12	Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar	Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number.	APPROX/RANDOM	2022	DBLP DOI BibTeX RDF
12	Anuj Dawar, Abhisekh Sankaran	MSO Undecidability for Hereditary Classes of Unbounded Clique Width.	CSL	2022	DBLP DOI BibTeX RDF
12	Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama	An Efficient Local Search for the Maximum Clique Problem on Massive Graphs.	EIDWT	2022	DBLP DOI BibTeX RDF
12	Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang	An Evolving Network Model from Clique Extension.	COCOON	2022	DBLP DOI BibTeX RDF
12	Karthik C. S., Subhash Khot	Almost Polynomial Factor Inapproximability for Parameterized k-Clique.	CCC	2022	DBLP DOI BibTeX RDF
12	Zebin Ren, Hongchao Qin, Rong-Hua Li, Yongheng Dai, Guoren Wang, Yanhui Li	Mining Periodic k-Clique from Real-World Sparse Temporal Networks.	APWeb/WAIM (1)	2022	DBLP DOI BibTeX RDF
12	Jun Wu 0020, Chu Min Li, Yupeng Zhou, Minghao Yin, Xin Xu, Dangdang Niu	HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem.	IJCAI	2022	DBLP DOI BibTeX RDF
12	Barbara Giunti, Guillaume Houry, Michael Kerber	Average Complexity of Matrix Reduction for Clique Filtrations.	ISSAC	2022	DBLP DOI BibTeX RDF
12	Md. Mainul Islam, Mpyana Mwamba Merlec, Hoh Peter In	A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique.	SCC	2022	DBLP DOI BibTeX RDF
12	Nicolas Grelier	Maximum Clique in Generalisations of Disk Graphs and Plane Geometric Graphs on Degenerate Point Sets.		2022	RDF
12	Shuli Hu, Xiaoli Wu, Huan Liu, Ruizhi Li, Minghao Yin	A novel two-model local search algorithm with a self-adaptive parameter for clique partitioning problem.	Neural Comput. Appl.	2021	DBLP DOI BibTeX RDF
12	Vanha Tran, Lizhen Wang 0001, Hongmei Chen 0003, Qing Xiao	MCHT: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm.	Expert Syst. Appl.	2021	DBLP DOI BibTeX RDF
12	Dhruv Rohatgi, John C. Urschel, Jake Wellens	Regarding Two Conjectures on Clique and Biclique Partitions.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
12	Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid	Tight Bounds on the Clique Chromatic Number.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
12	Bruno Q. Pinto, Celso C. Ribeiro, José A. Riveaux, Isabel Rosseti	A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Felipe Glaria, Cecilia Hernández, Susana Ladra, Gonzalo Navarro 0001, Lilian Salinas	Compact structure for sparse undirected graphs based on a clique graph partition.	Inf. Sci.	2021	DBLP DOI BibTeX RDF
12	Bo Peng, Lifan Wu, Yang Wang 0098, Qinghua Wu 0002	Solving maximum quasi-clique problem by a hybrid artificial bee colony approach.	Inf. Sci.	2021	DBLP DOI BibTeX RDF
12	Tiancheng Shen, Yibo Yang, Zhouchen Lin, Mingbin Zhang	Recurrent learning with clique structures for prostate sparse-view CT artifacts reduction.	IET Image Process.	2021	DBLP DOI BibTeX RDF
12	Jie Han 0002, Yoshiharu Kohayakawa, Yury Person	Near-perfect clique-factors in sparse pseudorandom graphs.	Comb. Probab. Comput.	2021	DBLP DOI BibTeX RDF
12		A weak clique based multi objective genetic algorithm for overlapping community detection in complex networks.	J. Ambient Intell. Humaniz. Comput.	2021	DBLP DOI BibTeX RDF
12	Christian Blum 0001, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl	Solving longest common subsequence problems via a transformation to the maximum clique problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Jiang Zhou, Changjiang Bu	Eigenvalues and clique partitions of graphs.	Adv. Appl. Math.	2021	DBLP DOI BibTeX RDF
12	Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf	Fast approximate shortest paths in the congested clique.	Distributed Comput.	2021	DBLP DOI BibTeX RDF
12	Luiz Moreira	Ramsey Goodness of Clique Versus Paths in Random Graphs.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
12	Clément Dallard, Martin Milanic, Kenny Storgel	Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
12	Lu Wang 0015, Feng Vankee Lin, Martin Cole, Zhengwu Zhang	Learning Clique Subgraphs in Structural Brain Network Classification with Application to Crystallized Cognition.	NeuroImage	2021	DBLP DOI BibTeX RDF
12	Xi Li 0014, Mingyou Wu, Hanwu Chen, Zhibao Liu	Algorithms for finding the maximum clique based on continuous time quantum walks.	Quantum Inf. Comput.	2021	DBLP DOI BibTeX RDF
12	Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001	Recognizing k-Clique Extendible Orderings.	Algorithmica	2021	DBLP DOI BibTeX RDF
12	Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura	A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
12	Yi-Wen Wei, Wei-Mei Chen, Hsin-Hung Tsai	Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs.	IEEE Trans. Parallel Distributed Syst.	2021	DBLP DOI BibTeX RDF
12	Adam N. Letchford, Paolo Ventura	Strengthened clique-family inequalities for the stable set polytope.	Oper. Res. Lett.	2021	DBLP DOI BibTeX RDF
12	Zheng Li, Jun Li, Chaoyue Wang, Zhiyang Lu, Jun Wang 0024, Hongjian He, Jun Shi 0004	Meta-Learning Based Interactively Connected Clique U-Net for Quantitative Susceptibility Mapping.	IEEE Trans. Computational Imaging	2021	DBLP DOI BibTeX RDF
12	Shenshen Gu, Hanmei Yao	Pointer Network Based Deep Learning Algorithm for the Maximum Clique Problem.	Int. J. Artif. Intell. Tools	2021	DBLP DOI BibTeX RDF
12	Yangdi Lyu, Prabhat Mishra 0001	Scalable Activation of Rare Triggers in Hardware Trojans by Repeated Maximal Clique Sampling.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2021	DBLP DOI BibTeX RDF
12	Jens Lange	CliquePercolation: An R Package for conducting and visualizing results of the clique percolation network community detection algorithm.	J. Open Source Softw.	2021	DBLP DOI BibTeX RDF
12	Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim 0002, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.	J. ACM	2021	DBLP DOI BibTeX RDF
12	Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov	Clique Is Hard on Average for Regular Resolution.	J. ACM	2021	DBLP DOI BibTeX RDF
12	Shaowei Cai 0001, Jinkun Lin, Yiyuan Wang, Darren Strash	A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.	J. Artif. Intell. Res.	2021	DBLP DOI BibTeX RDF
12	Shuo Pang	SOS lower bound for exact planted clique.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
12	Bogdán Zaválnij, Sándor Szabó	Estimating clique size via discarding subgraphs.	Informatica (Slovenia)	2021	DBLP DOI BibTeX RDF
12	Zuosong Liang, Yanxia Dong, Yancai Zhao, Huiyu Xing	Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4.	Graphs Comb.	2021	DBLP DOI BibTeX RDF
12	Kassahun Betre, Evatt Salinger	The Inductive Graph Dimension from the Minimum Edge Clique Cover.	Graphs Comb.	2021	DBLP DOI BibTeX RDF
12	Gal Kronenberg, Taísa Martins, Natasha Morrison	Weak saturation numbers of complete bipartite graphs in the clique.	J. Comb. Theory, Ser. A	2021	DBLP DOI BibTeX RDF
12	Bruno Benedetti, Davide Bolognini	Non-ridge-chordal complexes whose clique complex has shellable Alexander dual.	J. Comb. Theory, Ser. A	2021	DBLP DOI BibTeX RDF
12	Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, Jianan Wang	Solving diversified top-k weight clique search problem.	Sci. China Inf. Sci.	2021	DBLP DOI BibTeX RDF
12	Saeed Shahrivari, Saeed Jalili	Efficient Distributed k-Clique Mining for Large Networks Using MapReduce.	IEEE Trans. Knowl. Data Eng.	2021	DBLP DOI BibTeX RDF
12	Rong-Hua Li, Qiangqiang Dai, Lu Qin 0001, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao	Signed Clique Search in Signed Networks: Concepts and Algorithms.	IEEE Trans. Knowl. Data Eng.	2021	DBLP DOI BibTeX RDF
12	Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile	Eternal Domination and Clique Covering.	CoRR	2021	DBLP BibTeX RDF
12	Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-Mei W. Hwu	K-Clique Counting on GPUs.	CoRR	2021	DBLP BibTeX RDF
12	Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem 0001	Clique percolation method: memory efficient almost exact communities.	CoRR	2021	DBLP BibTeX RDF
12	J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich	Finding a Maximum Clique in a Grounded 1-Bend String Graph.	CoRR	2021	DBLP BibTeX RDF
12	Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin	Near-Optimal Scheduling in the Congested Clique.	CoRR	2021	DBLP BibTeX RDF
12	Minjia Pan, Rong-Hua Li, Qi Zhang 0010, Yongheng Dai, Qun Tian, Guoren Wang	Fairness-aware Maximal Clique Enumeration.	CoRR	2021	DBLP BibTeX RDF
12	Amogh Lonkar, Scott Beamer	Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations.	CoRR	2021	DBLP BibTeX RDF
12	Karthik C. S., Subhash Khot	Almost Polynomial Factor Inapproximability for Parameterized k-Clique.	CoRR	2021	DBLP BibTeX RDF
12	Xuandi Ren	A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More.	CoRR	2021	DBLP BibTeX RDF
12	Dipayan Chakraborty, Sandip Das 0001, Soumen Nandi, Debdeep Roy, Sagnik Sen 0001	On clique numbers of colored mixed graphs.	CoRR	2021	DBLP BibTeX RDF
12	Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim 0002, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.	CoRR	2021	DBLP BibTeX RDF
12	Uriel Feige, Tom Ferster	A tight bound for the clique query problem in two rounds.	CoRR	2021	DBLP BibTeX RDF
12	Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan	Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition.	CoRR	2021	DBLP BibTeX RDF
12	Jason Van Hulse, Joshua S. Friedman	Deep Learning Chromatic and Clique Numbers of Graphs.	CoRR	2021	DBLP BibTeX RDF
12	Hossein Teimoori Faal	On Clique Roots of Flat Graphs.	CoRR	2021	DBLP BibTeX RDF
12	Yucheng Wang, Bowen Yu 0002, Hongsong Zhu, Tingwen Liu, Nan Yu, Limin Sun	Discontinuous Named Entity Recognition as Maximal Clique Discovery.	CoRR	2021	DBLP BibTeX RDF
12	Dongkwon Jin, Wonhui Park, Seong-Gyun Jeong, Chang-Su Kim 0001	Harmonious Semantic Line Detection via Maximal Weight Clique Selection.	CoRR	2021	DBLP BibTeX RDF
12	Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang	The Automatic Quasi-clique Merger algorithm (AQCM).	CoRR	2021	DBLP BibTeX RDF
12	Bingkai Lin	Constant Approximating k-Clique is W[1]-hard.	CoRR	2021	DBLP BibTeX RDF