On the treewidth of dynamic graphs (Q744102): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1939628952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ad-hoc, mobile, and wireless networks. Second international conference ADHOC-NOW 2003, Montreal, Canada, October 8--10, 2003. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exploration of time-varying networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining regular properties dynamically in \(k\)-terminal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Propagation Speed in Mobile and Delay Tolerant Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and inference problems for temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Data Aggregation in Directed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Treewidth of Dynamic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed-parameter tractability of parameterized model-checking problems / rank
 
Normal rank

Latest revision as of 02:27, 9 July 2024

scientific article
Language Label Description Also known as
English
On the treewidth of dynamic graphs
scientific article

    Statements

    On the treewidth of dynamic graphs (English)
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    dynamic graphs
    0 references
    metatheorems
    0 references
    treewidth
    0 references
    local treewidth
    0 references
    bounded expansion
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers