Output-sensitive enumeration of maximal cliques in temporal graphs

DOI10.1016/J.DAM.2025.02.025MaRDI QIDQ6995810zbMATH OpenFDO

Authors Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino

Publication date 17 April 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.02.025

zbMATH Keywords

maximal cliquesoutput-sensitive enumerationtemporal graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A map of approaches to temporal networks
• An efficient updation approach for enumerating maximal (Δ,γ)-cliques of a temporal network
• An introduction to temporal graphs: an algorithmic perspective
• Analysis and enumeration. Algorithms for biological graphs
• Complex networks and link streams for the empirical analysis of large software
• Computing maximal cliques in link streams
• Enumerating maximal cliques in link streams with durations
• Enumeration complexity
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• On cliques in graphs
• On verifying and maintaining connectivity of interval temporal networks
• Proximity Search for Maximal Subgraph Enumeration
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs

This page was built for publication: Output-sensitive enumeration of maximal cliques in temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995810)