Pages that link to "Item:Q5918410"
From MaRDI portal
The following pages link to Feedback edge sets in temporal graphs (Q5918410):
Displaying 7 items.
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← 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)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)