arXiv (All)
open access
Tight bounds and output sensitive algorithms for maximal clique enumeration in link streams
A link stream is a set of interactions between pairs of vertices, each one lasting during some time interval, and a clique of a link stream is a set of vertices together with a time interval during which all of them interact. A clique is maximal if neither its vertex set nor its interval can be enla
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Upper Clique Transversal Problem: Hardness and Algorithms#1297967
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Counting $t$-wise $L$-intersecting cliques with prescribed intersection sizes#1037076
- Ranking and Rank Aggregation with Matroid Prefix Constraints#1155258
Record · ID 1248665
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive