article

Free access

Shifting Graphs and Their Applications

Authors:

Nicholas Pippenger,

Leslie G. ValiantAuthors Info & Claims

Journal of the ACM (JACM), Volume 23, Issue 3

Pages 423 - 432

https://doi.org/10.1145/321958.321962

Published: 01 July 1976 Publication History

Abstract

Graphs that in a certain precise sense are rich in sets of vertex-disjoint paths are studied. Bounds are obtained on the minimum number of edges in such graphs, and these are used to deduce nonlinear lower bounds on the computational complexity of shifting, merging, and matching problems.

References

[1]

BATCHER, K E Sortmg networks and their apphcatlons Proc AFIPS 1968 SJCC, Vol 32, AFIPS Press, Montvale, N.J, pp. 307-314

[2]

BEIZEI~, B The analysis and synthesis of signal switching networks Proc Symp on Math Theory of Automata, Brooklyn Polytechmc institute, Brooklyn, 1962, pp 563-576

[3]

BENE~, V E Mathematzcal Theory of Connectzng Networks and Telephone Traffic Academic Press, New York, 1965

[4]

FISCHER, M J, AND PATERSON, M S String matching and other products Tech Memo 41, M1T Project MAC, Jan 1974,

[5]

HYAFI~, L, PRUS~ER, F, AND VUILLEMIN, J An efficient algorithm for computing optimal disk merge patterns Proc Sixth Ann ACM Syrup on Theory of Comp, Seattle, 1974, pp 216-229

[6]

JOEL, A E JR On permutation switching networks Bell Syst Tech J 47 (1968), 813-822

[7]

KNUT~, D E The Art of Computer Programming, Vol. 3 Sorting and Searching Addison-Wesley, Reading, Mass, 1973

[8]

LAMAGNA, E A The complexity of monotone functions Ph D Th, Brown U, Providence, R I, 1975

[9]

LUPANOV, O B Ob odnom metode smteza skhem Izv. VUZ, Radmfizlka, No 1 (1958), 120-140

[10]

MORRIS, J H, AND PRATT, V R A hnear pattern matching algorithm Computer Center TR-40, U of Califorma, Berkeley, Cahf, June 1970

[11]

OFMAN, YU P Umversalnyl avtomat Trudy Mosk Mat Obshch 14 (1965), 186-199

[12]

PATERSON, M S, FISCHER, M J, AND MEYER, A R An improved overlap argument for on-hne multiplication SIAM-AMS Proc, Vol 7, 1974, pp 97-111

[13]

PINSKER, M S On the complemty of a concentrator Proc Seventh Internat Teletraffic Congr, Stockholm, 1973, pp 318/1-318/4 (available from Secretarmt, Televerket S-12386, Farsta, Sweden)

[14]

PIPPENGER, N J, AND FISCHER, M J Relations among complexity measures In preparation

[15]

SCWONHAGE, A, AND STaASSE~, V Schnelle Multlphkatmn grosser Zahlen Computing 7 (1971), 281-292

[16]

VALIANT, L G Parallehsm m comparison problems SIAM J Comput 4 (1975), 348-355

[17]

VALIANT, L G On non-hnear lower bounds m computational complemty Proc Seventh Ann ACM Symp on Theory of Comput, Albuquerque, N M, May 1975, pp 45-53

[18]

WAKSMAN, A A permutation network J ACM15, 1 (Jan 1968), 159-163

[19]

YAo, A C -C, AND YAO, F F Lower bounds on merging networks Unpubhshed manuscript, Oct 1974

Cited By

Chan TChung KMaggs BShi E(2022)Foundations of Differentially Oblivious AlgorithmsJournal of the ACM10.1145/355598469:4(1-49)Online publication date: 26-Aug-2022
https://dl.acm.org/doi/10.1145/3555984
Blocki JHolman BLee S(2022)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFsTheory of Cryptography10.1007/978-3-031-22318-1_3(52-79)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22318-1_3
Lingas A(2020)Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depthTheoretical Computer Science10.1016/j.tcs.2020.03.005Online publication date: Mar-2020
https://doi.org/10.1016/j.tcs.2020.03.005
Show More Cited By

Index Terms

Shifting Graphs and Their Applications
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

Equimatchable Graphs on Surfaces

A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied Mathematics
Abstract
Comparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset $P = (V, \leq)$ is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Collapsible graphs and Hamiltonian connectedness of line graphs

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 23, Issue 3

July 1976

175 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321958

Issue’s Table of Contents

Copyright © 1976 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1976

Published in JACM Volume 23, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

70
Total Citations
View Citations
699
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)27

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chan TChung KMaggs BShi E(2022)Foundations of Differentially Oblivious AlgorithmsJournal of the ACM10.1145/355598469:4(1-49)Online publication date: 26-Aug-2022
https://dl.acm.org/doi/10.1145/3555984
Blocki JHolman BLee S(2022)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFsTheory of Cryptography10.1007/978-3-031-22318-1_3(52-79)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22318-1_3
Lingas A(2020)Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depthTheoretical Computer Science10.1016/j.tcs.2020.03.005Online publication date: Mar-2020
https://doi.org/10.1016/j.tcs.2020.03.005
Chan TChung KMaggs BShi EChan T(2019)Foundations of differentially oblivious algorithmsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310585(2448-2467)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310585
Lin WShi EXie TChan T(2019)Can we overcome the n log n barrier for oblivious sorting?Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310583(2419-2438)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310583
Lingas AServedio R(2018)Small normalized boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depthProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235612(1-10)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235612
Lingas A(2017)Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean ConvolutionTheory and Applications of Models of Computation10.1007/978-3-319-55911-7_29(401-411)Online publication date: 21-Mar-2017
https://doi.org/10.1007/978-3-319-55911-7_29
Iván SLelkes ÁNagy-György JSzörényi BTurán G(2014)Biclique Coverings, Rectifier Networks and the Cost of ε-RemovalDescriptional Complexity of Formal Systems10.1007/978-3-319-09704-6_16(174-185)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09704-6_16
MORIZUMI HSUZUKI G(2010)Negation-Limited Inverters of Linear SizeIEICE Transactions on Information and Systems10.1587/transinf.E93.D.257E93-D:2(257-262)Online publication date: 2010
https://doi.org/10.1587/transinf.E93.D.257
Hromkovič JKanarek PKlasing RLoryś KUnger WWagener H(2009)On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree NetworksSIAM Journal on Discrete Mathematics10.1137/06066916423:3(1612-1645)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1137/060669164
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents