Pages that link to "Item:Q2009634"
From MaRDI portal
The following pages link to The complexity of finding small separators in temporal graphs (Q2009634):
Displaying 43 items.
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- The complexity of finding temporal separators under waiting time constraints (Q2059911) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- Mengerian temporal graphs revisited (Q2140509) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- On short fastest paths in temporal graphs (Q2232230) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
- Towards classifying the polynomial-time solvability of temporal betweenness centrality (Q2672438) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- (Q5089189) (← links)
- (Q5092419) (← links)
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5896891) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5918789) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Mengerian graphs: characterization and recognition (Q6078288) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality (Q6107024) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- The complexity of growing a graph (Q6112002) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- Untangling temporal graphs of bounded degree (Q6165555) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- On computing optimal temporal branchings (Q6546587) (← links)
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- A new temporal interpretation of cluster editing (Q6564624) (← links)
- Snapshot disjointness in temporal graphs (Q6589845) (← links)
- Temporally connected components (Q6612544) (← links)
- The complexity of growing a graph (Q6627045) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
- On computing optimal temporal branchings and spanning subgraphs (Q6655668) (← links)
