Pages that link to "Item:Q674341"
From MaRDI portal
The following pages link to Mixed searching and proper-path-width (Q674341):
Displaying 19 items.
- Edge search number of cographs (Q415273) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
