The following pages link to (Q4694712):
Displaying 19 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Mixed deterministic and probabilistic networks (Q841632) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- \(l_p\)-optimal rankings and max-optimal rankings are different (Q1696534) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Parameterized complexity of fair feedback vertex set problem (Q2663038) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- (Q5089157) (← links)
- Rankings of graphs (Q6184378) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal (Q6586648) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
