cliques
From MaRDI portal
Software:35346
No author found.
Related Items (17)
As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ A new temporal interpretation of cluster editing ⋮ Efficient temporal core maintenance of massive graphs ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ Computing maximal cliques in link streams ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ The Complexity of Finding Small Separators in Temporal Graphs ⋮ Graph signatures: identification and optimization ⋮ Computing parameters of sequence-based dynamic graphs ⋮ The complexity of finding small separators in temporal graphs ⋮ Temporal vertex cover with a sliding time window ⋮ An information-theoretic framework for the lossy compression of link streams ⋮ Temporal matching ⋮ Sliding window temporal graph coloring ⋮ Temporal cliques admit sparse spanners ⋮ The temporal explorer who returns to the base
This page was built for software: cliques
