scholarly journals Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Author(s):  
Erik D. Demaine ◽  
Quanquan C. Liu
Keyword(s):  

J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 317–329. - R. Statman. Equality between functionals revisited. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 331–338. - Robert E. Byerly. Mathematical aspects of recursive function theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 339–352.

1990 ◽  
Vol 55 (2) ◽  
pp. 876-878
Author(s):  
J. V. Tucker

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Audrey Lee ◽  
Ileana Streinu

International audience A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $kn'-l$ edges, $0 ≤l < 2k$. $G$ is tight if, in addition, it has exactly $kn - l$ edges. We characterize $(k,l)$-sparse graphs via a family of simple, elegant and efficient algorithms called the $(k,l)$-pebble games. As applications, we use the pebble games for computing components (maximal tight subgraphs) in sparse graphs, to obtain inductive (Henneberg) constructions, and, when $l=k$, edge-disjoint tree decompositions.


1989 ◽  
Vol 18 (3) ◽  
pp. 533-549 ◽  
Author(s):  
H. Venkateswaran ◽  
Martin Tompa

Author(s):  
Balagopal Komarath ◽  
Jayalal Sarma ◽  
Saurabh Sawlani
Keyword(s):  

Author(s):  
Grzegorz Malewicz ◽  
Arnold L. Rosenberg
Keyword(s):  

1978 ◽  
Vol 10 (2) ◽  
pp. 111-115 ◽  
Author(s):  
W. J. Paul ◽  
R. E. Tarjan
Keyword(s):  

2008 ◽  
Vol 308 (8) ◽  
pp. 1425-1437 ◽  
Author(s):  
Audrey Lee ◽  
Ileana Streinu
Keyword(s):  

1995 ◽  
Vol 75 (22) ◽  
pp. 4051-4054 ◽  
Author(s):  
D. J. Jacobs ◽  
M. F. Thorpe

Sign in / Sign up

Export Citation Format

Share Document