Pages that link to "Item:Q2930300"
From MaRDI portal
The following pages link to Finding shortest contractible and shortest separating cycles in embedded graphs (Q2930300):
Displaying 9 items.
- The cycle's structure of embedded graphs in surfaces (Q277096) (← links)
- Finding short cycles in embedded graph in polynomial time (Q977665) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- A contraction algorithm for finding small cycle cutsets (Q3813312) (← links)
- (Q5088964) (← links)
- Algorithms – ESA 2005 (Q5475826) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)