Structural parameters for dense temporal graphs
From MaRDI portal
Cites work
- A survey of the algorithmic aspects of modular decomposition
- Algorithmic meta-theorems for restrictions of treewidth
- An introduction to temporal graphs: an algorithmic perspective
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Burning a graph as a model of social contagion
- Burning a graph is hard
- Clique-width is NP-complete
- Computing maximal cliques in link streams
- Computing maximum matchings in temporal graphs
- Deleting edges to restrict the size of an epidemic in temporal networks
- Edge exploration of temporal graphs
- Feedback edge sets in temporal graphs
- Finding temporal paths under waiting time constraints
- Graph structure and monadic second-order logic. A language-theoretic approach
- Handle-rewriting hypergraph grammars
- Iterated Type Partitions
- Linear time solvable optimization problems on graphs of bounded clique-width
- Modular decomposition and transitive orientation
- On the treewidth of dynamic graphs
- Parameterized Algorithms for Modular-Width
- Parameterized algorithms
- Parameterized complexity of graph burning
- Polynomial-time recognition of clique-width 3 graphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Temporal Reachability Minimization: Delaying vs. Deleting
- Temporal interval cliques and independent sets
- Temporal network optimization subject to connectivity constraints
- The temporal explorer who returns to the base
- Transitiv orientierbare Graphen
- Upper bounds to the clique width of graphs
This page was built for publication: Structural parameters for dense temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241055)
