Coloring temporal graphs
From MaRDI portal
Publication:2237899
DOI10.1016/J.JCSS.2021.08.004zbMATH Open1472.68117OpenAlexW3196572318MaRDI QIDQ2237899FDOQ2237899
Authors: Yanyan Li 
Publication date: 28 October 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.08.004
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Reducibility among combinatorial problems
- On the Addressing Problem for Loop Switching
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized algorithms
- A simplified NP-complete satisfiability problem
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Node-and edge-deletion NP-complete problems
- Treewidth. Computations and approximations
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- The list chromatic index of a bipartite multigraph
- Choosability and fractional chromatic numbers
- Title not available (Why is that?)
- k-Components, Clusters and Slicings in Graphs
- Graph minors. III. Planar tree-width
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- The NP-completeness column: an ongoing guide
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- The biparticity of a graph
- Exploration of periodically varying graphs
- Choice Numbers of Graphs: a Probabilistic Approach
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Title not available (Why is that?)
- Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
- All structured programs have small tree width and good register allocation
- A \(c^k n\) 5-approximation algorithm for treewidth
- Parsimonious flooding in dynamic graphs
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- An introduction to temporal graphs: an algorithmic perspective
- Title not available (Why is that?)
- On the size and the approximability of minimum temporally connected subgraphs
- Sliding window temporal graph coloring
- Graph stories in small area
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
Cited In (7)
- Sliding window temporal graph coloring
- Snapshot disjointness in temporal graphs
- A new temporal interpretation of cluster editing
- The complexity of computing optimum labelings for temporal connectivity
- Finding colorful paths in temporal graphs
- An introduction to temporal graphs: an algorithmic perspective
- An introduction to temporal graphs: an algorithmic perspective
This page was built for publication: Coloring temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237899)
