Pages that link to "Item:Q1137871"
From MaRDI portal
The following pages link to The subgraph homeomorphism problem (Q1137871):
Displaying 16 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- (Q5149013) (← links)
- Green's function in partial subdivision networks (Q5205782) (← links)
- (Q5743515) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5918671) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)
- Brain chains as topological signatures for Alzheimer's disease (Q6650218) (← links)