The Resource Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
Resource Information
The item Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Summary
- Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques
- Language
- eng
- Extent
- 1 online resource (xi, 292 pages)
- Contents
-
- Optimization problems related to Internet congestion control / Richard Karp
- Problems in data structures and algorithms / Robert Tarjan
- Algorithmic graph theory and its applications / Martin Charles Golumbic
- Decompositions and forcing relations in graphs and other combinatorial structures / Ross McConnell
- The local ratio technique and its application to scheduling and resource allocation problems / Reuven Bar-Yehuda [and others]
- Domination analysis of combinatorial optimization algorithms and problems / Gregory Gutin and Anders Teo
- On multi-object auctions and matching theory : algorithmic aspects / Michal Penn and Moshe Tennenholtz
- Strategies for searching graphs / Shmuel Gal
- Recent trends in arc routing / Alain Hertz
- Software and hardware testing using combinatorial covering suites / Alan Hartman
- Incidences / Janos Pach and Micha Sharir
- Isbn
- 9786610312030
- Label
- Graph theory, combinatorics, and algorithms : interdisciplinary applications
- Title
- Graph theory, combinatorics, and algorithms
- Title remainder
- interdisciplinary applications
- Statement of responsibility
- edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
- Subject
-
- Algoritmen
- Algoritmen
- Combinatieleer
- Combinatieleer
- Combinatorial analysis
- Combinatorial analysis
- Combinatorial analysis
- Grafentheorie
- Grafentheorie
- Graph theory
- Graph theory
- Graph theory
- Graph theory -- Data processing
- Graph theory -- Data processing
- Graph theory -- Data processing
- MATHEMATICS -- Graphic Methods
- Language
- eng
- Summary
- Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques
- Cataloging source
- COO
- Dewey number
- 511/.5
- Illustrations
- illustrations
- Index
- no index present
- Language note
- English
- LC call number
- QA166
- LC item number
- .G7167 2005
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
-
- Golumbic, Martin Charles
- Hartman, Irith Ben-Arroyo
- Series statement
- Operations Research/Computer Science Interfaces Series,
- Series volume
- 34
- http://library.link/vocab/subjectName
-
- Graph theory
- Combinatorial analysis
- Graph theory
- MATHEMATICS
- Combinatorial analysis
- Graph theory
- Graph theory
- Combinatieleer
- Grafentheorie
- Algoritmen
- Label
- Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Optimization problems related to Internet congestion control / Richard Karp -- Problems in data structures and algorithms / Robert Tarjan -- Algorithmic graph theory and its applications / Martin Charles Golumbic -- Decompositions and forcing relations in graphs and other combinatorial structures / Ross McConnell -- The local ratio technique and its application to scheduling and resource allocation problems / Reuven Bar-Yehuda [and others] -- Domination analysis of combinatorial optimization algorithms and problems / Gregory Gutin and Anders Teo -- On multi-object auctions and matching theory : algorithmic aspects / Michal Penn and Moshe Tennenholtz -- Strategies for searching graphs / Shmuel Gal -- Recent trends in arc routing / Alain Hertz -- Software and hardware testing using combinatorial covering suites / Alan Hartman -- Incidences / Janos Pach and Micha Sharir
- Control code
- 62889904
- Dimensions
- unknown
- Extent
- 1 online resource (xi, 292 pages)
- Form of item
- online
- Isbn
- 9786610312030
- Lccn
- 2005042555
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/b106672
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-387-24347-4
- Specific material designation
- remote
- System control number
- (OCoLC)62889904
- Label
- Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Optimization problems related to Internet congestion control / Richard Karp -- Problems in data structures and algorithms / Robert Tarjan -- Algorithmic graph theory and its applications / Martin Charles Golumbic -- Decompositions and forcing relations in graphs and other combinatorial structures / Ross McConnell -- The local ratio technique and its application to scheduling and resource allocation problems / Reuven Bar-Yehuda [and others] -- Domination analysis of combinatorial optimization algorithms and problems / Gregory Gutin and Anders Teo -- On multi-object auctions and matching theory : algorithmic aspects / Michal Penn and Moshe Tennenholtz -- Strategies for searching graphs / Shmuel Gal -- Recent trends in arc routing / Alain Hertz -- Software and hardware testing using combinatorial covering suites / Alan Hartman -- Incidences / Janos Pach and Micha Sharir
- Control code
- 62889904
- Dimensions
- unknown
- Extent
- 1 online resource (xi, 292 pages)
- Form of item
- online
- Isbn
- 9786610312030
- Lccn
- 2005042555
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/b106672
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-387-24347-4
- Specific material designation
- remote
- System control number
- (OCoLC)62889904
Subject
- Algoritmen
- Algoritmen
- Combinatieleer
- Combinatieleer
- Combinatorial analysis
- Combinatorial analysis
- Combinatorial analysis
- Grafentheorie
- Grafentheorie
- Graph theory
- Graph theory
- Graph theory
- Graph theory -- Data processing
- Graph theory -- Data processing
- Graph theory -- Data processing
- MATHEMATICS -- Graphic Methods
Member of
- Operations research/computer science interfaces series, 34
- Operations research/computer science interfaces series, 34.
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theory-combinatorics-and-algorithms-/2zsaJt5HRu4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graph-theory-combinatorics-and-algorithms-/2zsaJt5HRu4/">Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theory-combinatorics-and-algorithms-/2zsaJt5HRu4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graph-theory-combinatorics-and-algorithms-/2zsaJt5HRu4/">Graph theory, combinatorics, and algorithms : interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
