cliques

swMATH23575MaRDI QIDQ35346FDOQ35346

Author name not available (Why is that?)

Described by source

• Enumerating maximal cliques in link streams with durations

Cited In (17)

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

This page was built for software: cliques