Graph signatures: identification and optimization

DOI10.1016/j.ejor.2021.03.051zbMath1490.90289OpenAlexW3150146885MaRDI QIDQ2242325

Hao Pan, Balabhaskar Balasundaram, Juan S. Borrero

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.03.051

zbMATH Keywords

networkstemporalfrequent subgraph miningrelationalcross-graph mining

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Related Items (1)

On atomic cliques in temporal graphs

Uses Software

• DIMACS
• GitHub
• cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An integer programming framework for critical elements detection in graphs
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• A branch and cut solver for the maximum stable set problem
• Computing maximal cliques in link streams
• Dominating sets in social network graphs
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
• Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
• Enumerating maximal cliques in link streams with durations
• Finding lasting dense subgraphs
• Parsimonious formulations for low-diameter clusters
• On clique relaxation models in network analysis
• On the maximum small-world subgraph problem
• An integer programming approach for finding the most and the least central cliques
• Evolution of social networks
• Novel approaches for analyzing biological networks
• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
• Encyclopedia of Social Network Analysis and Mining
• Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• Smallest-last ordering and clustering and graph coloring algorithms
• A graph‐theoretic definition of a sociometric clique†
• A graph‐theoretic generalization of the clique concept
• Graph Partitioning and Graph Clustering
• Selected Topics in Critical Element Detection
• An inequality for the chromatic number of a graph

This page was built for publication: Graph signatures: identification and optimization