article

Free access

Cost Trade-offs in Graph Embeddings, with Applications

Authors:

Jia-Wei Hong,

Kurt Mehlhorn, and

Arnold L. RosenbergAuthors Info & Claims

Journal of the ACM (JACM), Volume 30, Issue 4

Pages 709 - 728

https://doi.org/10.1145/2157.322401

Published: 01 October 1983 Publication History

PDF eReader

References

[1]

ALr:J.It~AS, R., AND ROSEI, tBI~G, A.L.On embedding rectangular grids in square grids. IEEE Trans. Comput., C-31 (1982), 907-913.

Google Scholar

[2]

BORODIN, A., Fiscrmg, M.J., KIRKPATRICK, D., LYNCH, N.A, AND TOMPA, M.A time,-spac~ tradeoff for sorting on rtonoblivious machines. In Proc. 20th IEEE Syrup. on Foundations of Computer Science (San Suan, Puerto Rico, Oct, 1979), IEEE, New York, pp. 319-327.

Google Scholar

[3]

CASSetS, J.W.S.An Introduction to Dlophantine ApproMmanon. Cambridge Tracts in Mathematics and Mathematical Physics 45, Cambridge University Press, Cambridge, England, 1957.

Google Scholar

[4]

CHAND~, A.K., Kozmq, D.C., A~ STOcga~Yrx, L.L Alternation. Jr. ACM 28, 1 (Jan. 1981), 114-133.

Crossref

Google Scholar

[5]

Credo, F.R.K., COPPERSMITH, D., AND GRAHAM, R.L. On trees containing all small trees. Unpublished manuscript, 1979.

Google Scholar

[6]

COBHAM, A.The recognition problem for the set of perfect squares. In Proc. 7th IEEE Symp. on Switching and Automata Theory (Berkeley, Calif., 1966), IEEE, New York, pp. 78-87.

Google Scholar

[7]

DEMn.Lo, R.A., EISm,~sxAT, S.C., XND LxPxolq, g.J. Oft small universal data stmetut~ attd related combinatorial problems. In Proc. Johns Hopkins Conf. on Information Sciences and Systems, Baltimore, Md., 1978, pp. 408-411.

Google Scholar

[8]

HoNG, L-W On similarity and duality of computauon. J. Comput. Syst. Sct. (to appear).

Google Scholar

[9]

HoNG, L-W., Awo ROSEt,rBm~O, A.L. Graphs that are almost binary trees. SIAM J. Comput. 11 (1982), 227-242.

Google Scholar

[10]

KuNo, H.T., ^ND S~WNSOr4, D. A software technique for reducting the routine time on a parallel computer with a fixed intereonneetion network. In High Speed Computer and Algorithm Optimization, Academic Press, New York, 1977, pp. 423--433

Google Scholar

[11]

LmOHTOr~, F.T., AND ROSEr~ErtG, A.L. Three-dimensional circuit layouts. Unpublished manuscript, 1982.

Google Scholar

[12]

Lmvas, P.M., STEARNS, R.E., AN~O ARTMANIS, J.Memory bounds for recogmtion of context-free and context-sensitive languages. In Proc 6th Conf. on Switching Circuit Theory and Logical Design, Ann Arbor, Mich., 1965, pp. 191-202.

Google Scholar

[13]

LreTor~, R.J., EISENSTAT, S.C., AND DEMH.LO, R.A. Space and time hierarchies for collections of control structures and data structures. Z A CM 23, 4 (Oct. 1976), 720-732.

Crossref

Google Scholar

[14]

LIPTON, R.L, AND TARJAN, R.E. ApplicaUons of a planar separator theorem. In Pro6 18th IEEE Syrup. on Foundations of Computer Science (Providence, R.I., Oct. 1977), IEEF., New York, pp. 162-170.

Google Scholar

[15]

I.,n~ToN, R.J., AIqD TT~tj~, R.E.A separator theorem for planar graphs. SIAM J. Appl. Math. 36 (1979), 17%489.

Google Scholar

[16]

M_Htt~ORN, K. Best possible bounds on the weighted path length of optimum binary search trees. SIAM Z Comput. 6 (1977), 235-239.

Google Scholar

[17]

ROSI~NBEItG, A.L. Encoding data structures in trees. Z A CM 26, 4 (Oct. 1979), 668-.689.

Crossref

Google Scholar

[18]

ROSEt~n~RG, A.L. Issues in the study of graph embeddings. In Graph- Theoraic Concepts m Computer Science (Proc. of the Int. Workshop WGS0), Lecture Notes in Computer Science 100, H. Noltemeier, Ed., Springer-Veda$, New York, 1981, pp. 150-176.

Crossref

Google Scholar

[19]

ROs~NB~sO, A.L Three-dimensional VLSI: A case study. J. ACM 30, 3 (July 1983), 397-416.

Crossref

Google Scholar

[20]

ROSENBEItG, A.L., AND SNYDER~ L. Bounds on the costs of data encodings. Math. Syst. Theory 12 (1978), 9-39.

Google Scholar

[21]

Ruzzo, W.L.Tree-size bounded alternation. (a)~ Comput. Syst. Sci. 21 (1980), 218-235; (Io)see also preliminary version in Proc. llth A CM Syrup. on Theory of Computing (Atlanta, Ga., May 1979), ACM, New York, pp. 352-3.59.

Crossref

Google Scholar

[22]

SAVITCH, W J. Relattonships between nondeterministi~ and deterministic tape complexities. ~ Comput. Syst. Sci. 4 (1970), 177--192.

Google Scholar

[23]

SEKA~^, M. On an ordering of the set of verdces of a connected graph Publ. Fac. Sci. Univ. Brag 412 (1960), 137-142.

Google Scholar

[24]

Thorn, soN, C,D.Area-time complexity for VLSI In Proc. llth ACM Syrup. on Theory of Computing (Atlanta, Ga., May 1979), ACM, New York, pp. 81-88.

Crossref

Google Scholar

[25]

VALIAN'r, L.G.Universality ~ons~derauons in VLSI circuits. IEEE Trans. Comput., C-30 (1981), 135-140.

Google Scholar

Cited By

View all

Zhang FQiu KKim J(2015)Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithmConcurrency and Computation: Practice and Experience10.1002/cpe.350327:16(4186-4193)Online publication date: 29-Apr-2015
https://doi.org/10.1002/cpe.3503
Hoefler TRabenseifner RRitzdorf Hde Supinski BThakur RTräff J(2011)The scalable process topology interface of MPI 2.2Concurrency and Computation: Practice & Experience10.1002/cpe.164323:4(293-310)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1002/cpe.1643
Bermond JMarlin NPeleg DPerennes S(2006)Directed virtual path layouts in ATM networksDistributed Computing10.1007/BFb0056475(75-88)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056475
Show More Cited By

Index Terms

Cost Trade-offs in Graph Embeddings, with Applications
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Cost Trade-Offs in System On Chip Designs
VLSID '00: Proceedings of the 13th International Conference on VLSI Design

Advances in technology have led to a drive towards System on Chip (SoC) designs. However, manufacturing and test costs have increased as rapidly as design complexity. Hence, in order to produce SoC designs at reasonable cost, both system-level and die-...
Read More
Leadtime-Inventory Trade-Offs in Assemble-To-Order Systems

This paper studies the trade-off between inventory levels and the delivery leadtime offered to customers in achieving a target level of service. It addresses the question of how much a delivery leadtime can be reduced, per unit increase in inventory, at ...
Read More
An EOQ inventory model with nonlinear stock dependent holding cost, nonlinear stock dependent demand and trade credit
Highlights
- This paper derives an EOQ model with nonlinear holding cost, nonlinear stock dependent demand.
Abstract
This paper deals with an economic order quantity (EOQ) inventory model under both nonlinear stock dependent demand and nonlinear holding cost. This inventory model is developed from retailer’s point of view, where the supplier offers a ...
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 30, Issue 4

Oct. 1983

179 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2157

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1983

Published in JACM Volume 30, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

77
Total Citations
View Citations
540
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang FQiu KKim J(2015)Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithmConcurrency and Computation: Practice and Experience10.1002/cpe.350327:16(4186-4193)Online publication date: 29-Apr-2015
https://doi.org/10.1002/cpe.3503
Hoefler TRabenseifner RRitzdorf Hde Supinski BThakur RTräff J(2011)The scalable process topology interface of MPI 2.2Concurrency and Computation: Practice & Experience10.1002/cpe.164323:4(293-310)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1002/cpe.1643
Bermond JMarlin NPeleg DPerennes S(2006)Directed virtual path layouts in ATM networksDistributed Computing10.1007/BFb0056475(75-88)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056475
Ben‐Natan RBarak A(2006)Parallel contractions of grids for task assignment to processor networksNetworks10.1002/net.323022060522:6(539-562)Online publication date: 11-Oct-2006
https://doi.org/10.1002/net.3230220605
Seo KKim S(2005)Minimizing Fragmentation in Contiguous Submesh Allocation SchemeThe KIPS Transactions:PartA10.3745/KIPSTA.2005.12A.2.11712A:2(117-126)Online publication date: 1-Apr-2005
https://doi.org/10.3745/KIPSTA.2005.12A.2.117
Seo KKim S(2005)A dynamic processor management strategy on the reconfigurable meshesInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2005.0078673:1(54-61)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1504/IJHPCN.2005.007867
Yu XYung M(2005)Scheduling task-tree with additive scales on parallel/distributed machinesComputing and Combinatorics10.1007/BFb0030883(607-616)Online publication date: 20-Jun-2005
https://doi.org/10.1007/BFb0030883
Bhatt SChung FLeighton FRosenberg A(2005)Tolerating faults in synchronization networksParallel Processing: CONPAR 92—VAPP V10.1007/3-540-55895-0_391(1-12)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-55895-0_391
Raghunathan ASaran H(2005)Is the shuffle-exchange better than the butterfly?ISA'91 Algorithms10.1007/3-540-54945-5_46(32-41)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-54945-5_46
Qiu KMeijer HAkl S(2005)Parallel routing and sorting on the pancake networkAdvances in Computing and Information — ICCI '9110.1007/3-540-54029-6_184(360-371)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-54029-6_184
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Cost Trade-Offs in System On Chip Designs

Leadtime-Inventory Trade-Offs in Assemble-To-Order Systems

An EOQ inventory model with nonlinear stock dependent holding cost, nonlinear stock dependent demand and trade credit

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations