Pages that link to "Item:Q2037193"
From MaRDI portal
The following pages link to Sliding window temporal graph coloring (Q2037193):
Displaying 13 items.
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Sharp Thresholds in Random Simple Temporal Graphs (Q6131198) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Untangling temporal graphs of bounded degree (Q6165555) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- Parity games on temporal graphs (Q6629452) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
