The complexity of node blocking for dags
DOI10.1016/J.JCTA.2010.03.011zbMATH Open1292.05185OpenAlexW2023995184MaRDI QIDQ616455FDOQ616455
Authors: Dariusz Dereniowski 
Publication date: 7 January 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2010.03.011
Recommendations
- The computational complexity of optimal blocking of vertices in the digraph
- scientific article; zbMATH DE number 1696521
- Node-searching problem on block graphs
- The parallel complexity of finding a blocking flow in a 3-layer network
- Parameterized complexity of DAG partitioning
- A parallel blocking flow algorithm for acyclic networks
- Blocking in parallel multisearch problems
- Blocking for external graph searching
- A digraph theoretic parallelism in block methods
Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- On the complexity of some two-person perfect-information games
- Title not available (Why is that?)
- The complexity of pursuit on a graph
- Misère annihilation games
- Title not available (Why is that?)
- PSPACE-Hardness of some combinatorial games
- Complexity of problems in games, graphs and algebraic equations
- Theory of annihilation games. I
- Theory of annihilation games
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The complexity of node blocking for dags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616455)
