On the treewidth of dynamic graphs
From MaRDI portal
Publication:744102
DOI10.1016/J.TCS.2013.12.024zbMATH Open1381.68225OpenAlexW1939628952MaRDI QIDQ744102FDOQ744102
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.024
Graph theory (including graph drawing) in computer science (68R10) Descriptive complexity and finite models (68Q19)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Characterisations and examples of graph classes with bounded expansion
- Distributed computation in dynamic networks
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Deciding first-order properties of locally tree-decomposable structures
- The Complexity of Data Aggregation in Directed Networks
- Dynamic algorithms for graphs of bounded treewidth
- On nowhere dense graphs
- The monadic second-order logic of graphs XVI : Canonical graph decompositions
- On the fixed-parameter tractability of parameterized model-checking problems
- On the exploration of time-varying networks
- Information Propagation Speed in Mobile and Delay Tolerant Networks
- Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
- Maintaining regular properties dynamically in \(k\)-terminal graphs
- Ad-hoc, mobile, and wireless networks. Second international conference ADHOC-NOW 2003, Montreal, Canada, October 8--10, 2003. Proceedings.
- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
- On the Treewidth of Dynamic Graphs
Cited In (8)
- On the computational complexity of dynamic graph problems
- Sharp lower and upper bounds for the Gaussian rank of a graph
- Computing parameters of sequence-based dynamic graphs
- Minimizing diameters of dynamic trees
- Dynamic algorithms for graphs with treewidth 2
- On Dynamic DFS Tree in Directed Graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Dynamic low-stretch trees via dynamic low-diameter decompositions
This page was built for publication: On the treewidth of dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744102)
