Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2024
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingJune 2024, Pages 923–934https://doi.org/10.1145/3618260.3649663We study the problem of finding and listing k-cliques in an m-edge, n-vertex graph, for constant k≥ 3. This is a fundamental problem of both theoretical and practical importance.
Our first contribution is an algorithmic framework for finding k-cliques ...
- ArticleJune 2024
Matheuristic Variants of DSATUR for the Vertex Coloring Problem
AbstractThis paper extends with matheuristic operators the seminal DSATUR heuristic for the Vertex Coloring Problem. Firstly, matheuristics are proposed to initialize saturation computing using a clique, a partial optimal coloring with selected vertices ...
- research-articleJuly 2022
Deterministic Near-Optimal Distributed Listing of Cliques
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingJuly 2022, Pages 271–280https://doi.org/10.1145/3519270.3538434The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether deterministic ...
- research-articleMarch 2021
An algorithm for the weighted stable set problem in claw-free graphs
- research-articleJanuary 2021
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
SIAM Journal on Computing (SICOMP), Volume 50, Issue 52021, Pages 1627–1662https://doi.org/10.1137/20M1335054We consider the pattern detection problem in graphs: given a constant size pattern graph $H$ and a host graph $G$, determine whether $G$ contains a subgraph isomorphic to $H$. We present the following new improved upper and lower bounds: We prove that if a ...
-
- research-articleJanuary 2021
Ramsey Goodness of Clique Versus Paths in Random Graphs
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 32021, Pages 2210–2222https://doi.org/10.1137/19M1285093We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$ and write $G \to (H_1,H_2)$ if every red-blue coloring of the edges of $G$ contains either a red copy of $H_1$ or a blue copy of $H_2$. In this paper we study the threshold for the event that the ...
- research-articleJanuary 2018
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights
SIAM Journal on Discrete Mathematics (SIDMA), Volume 32, Issue 32018, Pages 2115–2133https://doi.org/10.1137/17M1138303We determine, asymptotically in $n$, the distribution and mean of the weight of a minimum-weight $k$-clique (or any strictly balanced graph $H$) in a complete graph $K_n$ whose edge weights are independent random values drawn from the uniform distribution or ...
- abstractNovember 2017
Interactive design and visualization of N-ary relationships
SA '17: SIGGRAPH Asia 2017 Symposium on VisualizationNovember 2017, Article No.: 15, Pages 1–8https://doi.org/10.1145/3139295.3139314Graph and network visualization is a well-researched area. However, graphs are limited in that by definition they are designed to encode pairwise relationships between the nodes in the graph. In this paper, we strive for visualization of datasets that ...
- research-articleAugust 2017
Fast Enumeration of Large k-Plexes
KDD '17: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data MiningAugust 2017, Pages 115–124https://doi.org/10.1145/3097983.3098031K-plexes are a formal yet flexible way of defining communities in networks. They generalize the notion of cliques and are more appropriate in most real cases: while a node of a clique C is connected to all other nodes of C, a node of a k-plex may miss ...
- research-articleApril 2017
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
WWW '17: Proceedings of the 26th International Conference on World Wide WebApril 2017, Pages 441–449https://doi.org/10.1145/3038912.3052636Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-...
- articleJanuary 2016
Identifying communities and influential node in Facebook fan page - a case study of FJU 2013 ad camp
International Journal of Web Based Communities (IJWBC), Volume 12, Issue 4January 2016, Pages 376–392https://doi.org/10.1504/IJWBC.2016.080813In this paper, we contribute to the understanding of a business-like Facebook fan page by investigating the network structure of FJU ad camp fan page created exclusively for summer camp recruitment. In our approach, we first characterise the network ...
- articleJanuary 2016
Detecting negative relations in social networks
International Journal of Communication Networks and Distributed Systems (IJCNDS), Volume 17, Issue 2January 2016, Pages 164–188https://doi.org/10.1504/IJCNDS.2016.079100Online social networks are drawing attention to a large number of users who interact with each other to form positive and negative relations. Positive relations are produced from friendship, liking, trust whereas negative relations are outcome of ...
- articleJanuary 2016
A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs
Journal of Graph Theory (JGTH), Volume 81, Issue 1January 2016, Pages 57–72https://doi.org/10.1002/jgt.21861We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin [7] holds for all but finitely many graphs. We also use our method to prove special cases ...
- ArticleApril 2015
Cluster Based Routing in NDN
ITNG '15: Proceedings of the 2015 12th International Conference on Information Technology - New GenerationsApril 2015, Pages 296–301https://doi.org/10.1109/ITNG.2015.54Named Data Networking (NDN) being a potential future technology designed as a distribution network alternative to the present day host oriented IP-based host-oriented Internet architecture. Some arguments against NDN implementation over other candidate ...
- articleMarch 2015
Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal
Journal of Graph Theory (JGTH), Volume 78, Issue 3March 2015, Pages 229–238https://doi.org/10.1002/jgt.21801For given integers k,l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar phenomenon is ...
- ArticleJanuary 2015
Guilt-by-Constellation: Fraud Detection by Suspicious Clique Memberships
HICSS '15: Proceedings of the 2015 48th Hawaii International Conference on System SciencesJanuary 2015, Pages 918–927https://doi.org/10.1109/HICSS.2015.114Given a labeled graph containing fraudulent and legitimate nodes, which nodes group together? How can we use the riskiness of node groups to infer a future label for new members of a group? This paper focuses on social security fraud where companies are ...
- posterSeptember 2014
A powerful and robust co-expression network analysis algorithm
BCB '14: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health InformaticsSeptember 2014, Page 581https://doi.org/10.1145/2649387.2660558Networks provide classic approaches to model complex systems, hence their wide application to investigate biological systems. Many types of biological networks are available; we have focused on co-expression networks. Co-expression networks have become ...
- ArticleMay 2012
Finding top-n colossal patterns based on clique search with dynamic update of graph
ICFCA'12: Proceedings of the 10th international conference on Formal Concept AnalysisMay 2012, Pages 244–259https://doi.org/10.1007/978-3-642-29892-9_23In this paper, we discuss a method for finding top-N colossal frequent patterns. A colossal pattern we try to extract is a maximal pattern with top-N largest length. Since colossal patterns can be found in relatively lower areas of an itemset (concept) ...
- ArticleSeptember 2011
Clique-Detection Algorithm Using Clique-Self-Assembly
BIC-TA '11: Proceedings of the 2011 Sixth International Conference on Bio-Inspired Computing: Theories and ApplicationsSeptember 2011, Pages 225–230https://doi.org/10.1109/BIC-TA.2011.32Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled ...
- ArticleAugust 2011
Discovering text patterns by a new graphic model
MLDM'11: Proceedings of the 7th international conference on Machine learning and data mining in pattern recognitionAugust 2011, Pages 428–442We propose a probabilistic graphical model that works for recognizing three types of text patterns in a sentence: noun phrases; the meaning of an ambiguous word; and semantic arguments of a verb. The model has an unique mathematical expression and ...