Author:
Fomin Fedor V,Kratsch Dieter,Müller Haiko
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference38 articles.
1. The bandwidth of a tree with k leaves is at most ⌈ k/2 ⌉;Ando;Discrete Math.,1996
2. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 25, The Association for Computing Machinery, 1993, pp. 294–304.
3. S.L. Bezrukov, Isoperimetric problems in discrete spaces, in: Extremal Problems for Finite Sets (Visegrád, 1991), János Bolyai Math. Soc., Budapest, 1994, pp. 59–91.
4. Graph searching, path-width, tree-width and related problems;Bienstock;DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,1991
5. Monotonicity in graph searching;Bienstock;J. Algorithms,1991
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DAG-width is PSPACE-complete;Theoretical Computer Science;2016-12
2. Complexity and monotonicity results for domination games;Theoretical Computer Science;2016-05
3. Graph Searching Games and Width Measures for Directed Graphs;LEIBNIZ INT PR INFOR;2015
4. Graph Searching and Related Problems;Handbook of Combinatorial Optimization;2013
5. Graph Search Techniques;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15