Pages that link to "Item:Q3521919"
From MaRDI portal
The following pages link to The Travelling Salesman Problem in Bounded Degree Graphs (Q3521919):
Displaying 25 items.
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- Set multi-covering via inclusion-exclusion (Q837180) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- Truncated \(M\)-travelling salesman problem (Q998696) (← links)
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- The graphical traveling salesperson problem has no integer programming formulation in the original space (Q2060618) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals (Q2180182) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected (Q3058703) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- (Q5090377) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- The analyst's traveling salesman theorem in graph inverse limits (Q5350296) (← links)
- Simplifying Inclusion–Exclusion Formulas (Q5364235) (← links)
