| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 12 | Gregory Lupton, Nicholas A. Scoville |
Digital fundamental groups and edge groups of clique complexes.  |
J. Appl. Comput. Topol.  |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Anita Liebenau, Rajko Nenadov |
The threshold bias of the clique-factor game. |
J. Comb. Theory, Ser. B |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Hong Liu 0010, Guanghui Wang 0002, Donglei Yang |
Clique immersion in graphs without a fixed bipartite graph. |
J. Comb. Theory, Ser. B |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Robert Brignall, Daniel Cocks |
Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. |
Electron. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Tal Laor |
Twitter as a clique: journalists' patterns of Twitter use in Israel. |
Online Inf. Rev. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos |
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. |
SIAM J. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Weiqi Fu, Pan Shao, Ting Dong, Zhewei Liu |
Novel Higher-Order Clique Conditional Random Field to Unsupervised Change Detection for Remote Sensing Images. |
Remote. Sens. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Chi Hoi Yip |
On the clique number of Paley graphs of prime power order. |
Finite Fields Their Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Dóra Kardos, Patrik Patassy, Sándor Szabó, Bogdán Zaválnij |
Numerical experiments with LP formulations of the maximum clique problem. |
Central Eur. J. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Kenji Kanazawa |
FPGA Acceleration of Swap-Based Tabu Search for Solving Maximum Clique Problems. |
J. Inf. Process. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Fairouz Hussein, Subhieh El-Salhi, Rajaa Alazazma, Tasneem Abu-Hantash, Haneen Abu-Hantash, Heba Thaher |
An Android Application Using Machine Learning Algorithm for Clique Detection in Issues Related to Transportation. |
Int. J. Interact. Mob. Technol. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Pingping Wu, Lizhen Wang 0001, Muquan Zou |
A maximal ordered ego-clique based approach for prevalent co-location pattern mining. |
Inf. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux |
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. |
Inf. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Jing Bai 0011, Junfeng Zhou, Ming Du, Ziyang Chen |
Index-based top kα-maximal-clique enumeration over uncertain graphs. |
J. Supercomput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Kazuma Fuchimoto, Takatoshi Ishii, Maomi Ueno |
Hybrid Maximum Clique Algorithm Using Parallel Integer Programming for Uniform Test Assembly. |
IEEE Trans. Learn. Technol. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Shuliang Wang, Xiaorui Qin, Lianhua Chi |
HashWalk: An efficient node classification method based on clique-compressed graph embedding. |
Pattern Recognit. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Baiguo An, Guozhong Feng, Jianhua Guo 0005 |
Interaction Identification and Clique Screening for Classification with Ultra-high Dimensional Discrete Features. |
J. Classif. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Arpita Sanyal (Bhaduri), Amit Saha, Banani Saha, Amlan Chakrabarti |
Circuit design for clique problem and its implementation on quantum computer. |
IET Quantum Commun. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Shuli Li, Tao Tian |
Resistance Between Two Nodes of a Ring Clique Network. |
Circuits Syst. Signal Process. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile |
Complexity and heuristics for the weighted max cut-clique problem. |
Int. Trans. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mohammad Izadi, Hari Mohan Srivastava |
Fractional Clique Collocation Technique for Numerical Simulations of Fractional-Order Brusselator Chemical Model. |
Axioms |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Qian Liu 0008, Zebin Wu 0001, Qian Du 0001, Yang Xu 0006, Zhihui Wei |
Multiscale Alternately Updated Clique Network for Hyperspectral Image Classification. |
IEEE Trans. Geosci. Remote. Sens. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Chuan-Min Lee |
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. |
Symmetry |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sándor Szabó, Bogdán Zaválnij |
Graph Coloring via Clique Search with Symmetry Breaking. |
Symmetry |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich |
Finding a Maximum Clique in a Grounded 1-Bend String Graph. |
J. Graph Algorithms Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Jinyu Dai, Zhengtian Wu, Hamid Reza Karimi, Baoping Jiang, Guangquan Lu |
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network. |
J. Frankl. Inst. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Muyuan Lin, Varun Murali, Sertac Karaman |
A Planted Clique Perspective on Hypothesis Pruning. |
IEEE Robotics Autom. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yu-Kai Lin, Wen-Chieh Lin, Chieh-Chih Wang |
K-Closest Points and Maximum Clique Pruning for Efficient and Effective 3-D Laser Scan Matching. |
IEEE Robotics Autom. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Chenglong Dai, Jia Wu 0001, Dechang Pi, Stefanie I. Becker, Lin Cui 0002, Qin Zhang 0011, Blake W. Johnson |
Brain EEG Time-Series Clustering Using Maximum-Weight Clique. |
IEEE Trans. Cybern. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhi Lu, Yi Zhou 0016, Jin-Kao Hao |
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. |
IEEE Trans. Cybern. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sumit Kumar Gupta, Dhirendra Pratap Singh, Jaytrilok Choudhary |
A review of clique-based overlapping community detection algorithms. |
Knowl. Inf. Syst. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Tuukka Korhonen |
Finding Optimal Triangulations Parameterized by Edge Clique Cover. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. |
Algorithmica |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sebastián Bustamante 0001, Daniel A. Quiroz, Maya Stein, José Zamora |
Clique immersions and independence number. |
Eur. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Xiaoyu He, Jiaxi Nie, Sam Spiro |
Maximal independent sets in clique-free graphs. |
Eur. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Peter Frankl, Erica L. L. Liu, Jian Wang 0092 |
On the maximum number of edges in hypergraphs with fixed matching and clique number. |
Eur. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhuo Yu, Xiaofeng Wang, Jian Zhao 0002 |
A local dense decision-making method for solving the maximum clique problem in large-scale undirected graphs. |
Comput. Electr. Eng. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Marco A. López Medina, J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín |
Computing the Clique-Width on Series-Parallel Graphs. |
Computación y Sistemas |
2022 |
DBLP BibTeX RDF |
|
| 12 | Mehdi Kadivar, Neda Mohammadi |
A maximum clique based approximation algorithm for wireless link scheduling under SINR model. |
J. Comput. Syst. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mohammad Mehdi Daliri Khomami, Mohammad Reza Meybodi, Reyhaneh Ameri |
Cellular goore game with application to finding maximum clique in social networks. |
J. Comput. Des. Eng. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile |
Eternal domination and clique covering. |
Electron. J. Graph Theory Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Douglas Frederico Guimarães Santiago, Anderson Luiz Pedrosa Porto, Kaio Ariel Silva Sá |
A generalization of a Turán's theorem about maximum clique on graphs. |
Electron. J. Graph Theory Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Shuchita Goyal, Samir Shukla, Anurag Singh 0003 |
Topology of clique complexes of line graphs. |
Art Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Daniil Baldouski |
Product irregularity strength of graphs with small clique cover number. |
Art Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Supachoke Isariyapalakul, Witsarut Pho-on, Varanoot Khemmani |
Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number. |
AKCE Int. J. Graphs Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Michal Dory, Merav Parter |
Exponentially Faster Shortest Paths in the Congested Clique. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Jian Gao 0007, Yiqi Lv, Minghao Liu 0001, Shaowei Cai 0001, Feifei Ma |
Improving Simulated Annealing for Clique Partitioning Problems. |
J. Artif. Intell. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Wanfang Chen, Changhong Lu, Long-Tu Yuan |
Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. |
Graphs Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yu Du, Gary A. Kochenberger, Fred W. Glover, Haibo Wang 0001, Mark W. Lewis, Weihong Xie, Takeshi Tsuyuguchi |
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. |
Int. J. Inf. Technol. Decis. Mak. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Shengli Sun, Weiping Li, Yimo Wang, Weilong Liao, Philip S. Yu |
Continuous Monitoring of Maximum Clique Over Dynamic Graphs. |
IEEE Trans. Knowl. Data Eng. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Kedong Yan, Hong Seo Ryoo |
Graph, clique and facet of boolean logical polytope. |
J. Glob. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Arpita Sanyal (Bhaduri), Amit Saha, Banani Saha, Amlan Chakrabarti |
Robust Quantum Circuit for Clique Problem with Intermediate Qudits. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Soura Sena Das, Soumen Nandi, Sagnik Sen 0001 |
The oriented relative clique number of triangle-free planar graphs is 10. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
Algorithms approaching the threshold for semi-random planted clique. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Zi Chen, Long Yuan, Xuemin Lin 0001, Lu Qin 0001, Wenjie Zhang 0001 |
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sebastian Forster, Tijn de Vos |
The Laplacian Paradigm in the Broadcast Congested Clique. |
CoRR |
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-clique Listing with Set Intersection Speedup [Technical Report]. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yimeng Min, Frederik Wenkel, Michael Perlmutter, Guy Wolf |
Can Hybrid Geometric Scattering Networks Help Solve the Maximal Clique Problem? |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl |
Locally checkable problems in bounded clique-width graphs. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Anisur Rahaman Molla, Manish Kumar, Sumathi Sivasubramaniam |
Fault-Tolerant Graph Realizations in the Congested Clique. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Ahammed Ullah |
Computing Clique Cover with Structural Parameterization. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Quanquan C. Liu |
A Note on Improved Results for One Round Distributed Clique Listing. |
CoRR |
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. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mitre Costa Dourado, Rodolfo Alves de Oliveira, Vitor S. Ponciano, Alessandra B. Queiróz, Rômulo L. O. da Silva |
Expanded-clique graphs and the domination problem. |
CoRR |
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. |
CoRR |
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. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Robert Brignall, Daniel Cocks |
A framework for minimal hereditary classes of graphs of unbounded clique-width. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuto Watanabe, Kazunori Sakurama |
Accelerated Distributed Projected Gradient Descent for Convex Optimization with Clique-wise Coupled Constraints. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Shivani Bathla, Vinita Vasudevan |
IBIA: Bayesian Inference via Incremental Build-Infer-Approximate operations on Clique Trees. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 12 | Sujoy Bhore, Fabian Klute, Jelle J. Oostveen |
On Streaming Algorithms for Geometric Independent Set and Clique. |
CoRR |
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. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 12 | Peter Robinson 0002 |
What Can We Compute in a Single Round of the Congested Clique? |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-mei W. Hwu |
Parallelizing Maximal Clique Enumeration on GPUs. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Dmitriy Kunisky, Xifan Yu |
A degree 4 sum-of-squares lower bound for the clique number of the Paley graph. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Marina Moscarini |
A necessary condition for the equality of the clique number and the convexity number of a graph. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Annegret Katrin Wagler |
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Christoph Brause, Maximilian Geißer, Ingo Schiermeyer |
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Grahame Erskine, Terry S. Griggs, Jozef Sirán |
Clique-partitioned graphs. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio |
Edge clique partition in (k, ℓ)-graphs. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros |
Worst-case analysis of clique MIPs. |
Math. Program. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | K. Venkatakrishna Rao, Mahender Katukuri, Maheswari Jagarapu |
CIM: clique-based heuristic for finding influential nodes in multilayer networks. |
Appl. Intell. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yanhao Yang, Pan Shi, Yuyi Wang 0001, Kun He 0001 |
Quadratic Optimization based Clique Expansion for overlapping community detection. |
Knowl. Based Syst. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | János Barta, Roberto Montemanni |
The Maximum Clique Problem for Permutation Hamming Graphs. |
J. Optim. Theory Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Miyuki Koshimura, Emi Watanabe, Yuko Sakurai, Makoto Yokoo |
Concise integer linear programming formulation for clique partitioning problems. |
Constraints An Int. J. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Markus Baumeister, Anna M. Limbach |
Clique dynamics of locally cyclic graphs with δ ≥ 6. |
Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Gholamreza Abrishami, Michael A. Henning, Mostafa Tavakoli |
Local metric dimension for graphs with small clique numbers. |
Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Zixiang Xu, Gennian Ge |
A note on multicolor Ramsey number of small odd cycles versus a large clique. |
Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | András Imolay, Anett Kocsis, Ádám Schweitzer |
Clique number of Xor products of Kneser graphs. |
Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Sam Mattheus, Francesco Pavese |
A clique-free pseudorandom subgraph of the pseudo polarity graph. |
Discret. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | René Thiemann |
Clique is not solvable by monotone circuits of polynomial size. |
Arch. Formal Proofs |
2022 |
DBLP BibTeX RDF |
|
| 12 | Matija Bucic, Jacob Fox, Benny Sudakov |
Clique minors in graphs with a forbidden subgraph. |
Random Struct. Algorithms |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Srinibas Swain, Deepak Puthal, Elisa Bertino |
CryptoCliqIn: Graph-Theoretic Cryptography Using Clique Injection. |
IEEE Intell. Syst. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Yehor Blokhin, Sergiy Butenko, Petar Momcilovic, Oleg A. Prokopyev |
On maximum ratio clique relaxations. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu |
A balm: defend the clique-based attack from a fundamental aspect. |
J. Comb. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Nicolas Grelier |
Computing a maximum clique in geometric superclasses of disk graphs. |
J. Comb. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhonghui Mei, Xiaoyan Zhou |
Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes. |
IEEE Commun. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license