On the treewidth of dynamic graphs
type: Item
instance of: scholarly article
title: On the treewidth of dynamic graphs
zbMATH Open document ID: 1381.68225
author: Bernard Mans
author: Luke Mathieson
published in: Theoretical Computer Science
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 6351436
zbMATH Keywords: dynamic graphs
zbMATH Keywords: metatheorems
zbMATH Keywords: treewidth
zbMATH Keywords: local treewidth
zbMATH Keywords: bounded expansion
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.12.024
OpenAlex ID: W1939628952
cites work: Q5689807
cites work: Ad-hoc, mobile, and wireless networks. Second international conference ADHOC-NOW 2003, Montreal, Canada, October 8--10, 2003. Proceedings.
cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
cites work: Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
cites work: Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
cites work: Q4234136
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions
cites work: Q4947393
cites work: Q4503944
cites work: Q4850061
cites work: Q5422334
cites work: On the exploration of time-varying networks
cites work: Parametrized complexity theory.
cites work: Maintaining regular properties dynamically in \(k\)-terminal graphs
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: Dynamic algorithms for graphs of bounded treewidth
cites work: Information Propagation Speed in Mobile and Delay Tolerant Networks
cites work: Connectivity and inference problems for temporal networks
cites work: Distributed computation in dynamic networks
cites work: The Complexity of Data Aggregation in Directed Networks
cites work: On the Treewidth of Dynamic Graphs
cites work: On nowhere dense graphs
cites work: Characterisations and examples of graph classes with bounded expansion
cites work: Q5710169
cites work: On the fixed-parameter tractability of parameterized model-checking problems
DOI: 10.1016/J.TCS.2013.12.024
description: scientific article; zbMATH DE number 6351436