The following pages link to Luitpold Babel (Q190504):
Displaying 25 items.
- (Q807638) (redirect page) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Recognizing the \(P_4\)-structure of bipartite graphs (Q1296570) (← links)
- The \(k\)-partitioning problem (Q1298757) (← links)
- On the \(p\)-connectedness of graphs---a survey (Q1302141) (← links)
- A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- Design of tariff zones in public transportation networks: theoretical results and heuristics (Q1880246) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Trajectory planning for unmanned aerial vehicles: a network optimization approach (Q1935911) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- (Q2714402) (← links)
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs (Q3837386) (← links)
- (Q4232800) (← links)
- (Q4373667) (← links)
- (Q4373668) (← links)
- (Q4474134) (← links)
- (Q4533373) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- Efficient algorithms for graphs with few \(P_4\)'s (Q5937917) (← links)
