The following pages link to (Q4414633):
Displayed 18 items.
- On eigenspaces of some compound signed graphs (Q314742) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Gain-line graphs via \(G\)-phases and group representations (Q2229460) (← links)
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Optimization with binet matrices (Q2467475) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
- Switching Graphs (Q4982090) (← links)
- Total graph of a signed graph (Q5056836) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q5499730) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Graph covering using bounded size subgraphs (Q6132557) (← links)