On the Complexity of Finding Optimal Edge Rankings - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > On the Complexity of Finding Optimal Edge Rankings
On the Complexity of Finding Optimal Edge Rankings

On the Complexity of Finding Optimal Edge Rankings


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "On the Complexity of Finding Optimal Edge Rankings" by 余鳳玲, Fung-ling, Yue, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled "On the Complexity of Finding Optimal Edge Rankings" submitted by Yue Fung Ling for the degree of Master of Philosophy at the University of Hong Kong in December 1996 In this thesis, we study the complexity of finding an optimal edge ranking of a graph. AnedgerankingofanundirectedgraphGisalabelingofitsedgeswithpositive integers such that every path between two edges with the same label i contains an intermediate edge with a label j >i. An edge ranking is optimal if it uses the least number of distinct labels among all possible edge rankings. The study of optimal edge rankings is initiated by Iyer, Ratliff and Vijayan, who found this problem has an interesting application in scheduling the assembly of multipart products. In this work, we show that the edge ranking problem which, given a graphG and anintegert, determineswhetherGhasanedgerankingusingatmosttdistinctlabels, is NP-complete, thus proving that the problem does not admit any polynomial time algorithm unless P = NP. Finding an optimal edge ranking of a tree has a practical application in the as- sembly of multipart products. This problem has been studied quite intensively by a numberof researchers. Thebestknownalgorithm is given by Zhouand Nishizeki and has runningtimeO(n logΔ) wheren is the numberof nodes in the tree and Δ is the maximum degree. We improve their work with a number of novel ideas, and obtain the first O(n) time algorithm for finding an optimal edge ranking of a tree with n nodes. We initiate a study on the best polynomial time approximation algorithm for the edge ranking problem of graphs. We present a non-approximability proof that no polynomial time algorithms can give a performance guarantee within an additive -ǫ value ofm of the optimal for any constantǫ>0, wherem is the number of edges in the graph. We also derive an approximation algorithm for finding an edge ranking of a graph with m edges using no more than clog m times the number of distinct labels used by the optimal edge ranking for some constant c>0. DOI: 10.5353/th_b3014888 Subjects: Trees (Graph theory) Computational complexity


Best Sellers


Product Details
  • ISBN-13: 9781374725775
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 86
  • Weight: 222 gr
  • ISBN-10: 1374725773
  • Publisher Date: 27 Jan 2017
  • Binding: Paperback
  • Language: English
  • Spine Width: 5 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
On the Complexity of Finding Optimal Edge Rankings
Open Dissertation Press -
On the Complexity of Finding Optimal Edge Rankings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

On the Complexity of Finding Optimal Edge Rankings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!