|
Showing 1 - 4 of
4 matches in All Departments
This volume contains the proceedings of the 19th International
Symposium on Algorithmsand Computation (ISAAC 2008), held on the
Gold Coast, Australia, December 15-17, 2008. In the past, it was
held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong
(1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore
(1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch
(2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004), Hainan
(2005), Kolkata (2006), and Sendai (2007). ISAACis
anannualinternationalsymposiumthatcoversthe verywide range of
topics in the ?eld of algorithms and computation. The main purpose
of the symposium is to provide a forum for researchers working in
algorithms and theoryofcomputationfrom allovertheworld.In
responseto ourcallfor papers, we received 229 submissions from 40
countries. The task of selecting the papers in this volume was done
by our Program Committee and many other external reviewers. After
an extremely rigorous review process and extensive discussion, the
Committee selected 78 papers. We hope all accepted papers will
eventually appear in scienti?c journals in a more polished form.
Two special issues, one of Algorithmica and one of the
International Journal on Computational Geometry and Applications,
with selected papers from ISAAC 2008 are in preparation
|
Algorithms and Computation - 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings (Paperback, 1996 ed.)
Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
|
R1,789
Discovery Miles 17 890
|
Ships in 10 - 15 working days
|
This book constitutes the refereed proceedings of the 7th
International Symposium on Algorithms and Computation, ISAAC'96,
held in Osaka, Japan, in December 1996.
The 43 revised full papers were selected from a total of 119
submissions; also included are an abstract of one invited talk and
a full version of a second. Among the topics covered are
computational geometry, graph theory, graph algorithms,
combinatorial optimization, searching and sorting, networking,
scheduling, and coding and cryptology.
Algorithmic Aspects of Graph Connectivity is the first
comprehensive book on this central notion in graph and network
theory, emphasizing its algorithmic aspects. Because of its wide
applications in the fields of communication, transportation, and
production, graph connectivity has made tremendous algorithmic
progress under the influence of the theory of complexity and
algorithms in modern computer science. The book contains various
definitions of connectivity, including edge-connectivity and
vertex-connectivity, and their ramifications, as well as related
topics such as flows and cuts. The authors thoroughly discuss new
concepts and algorithms that allow for quicker and more efficient
computing, such as maximum adjacency ordering of vertices. Covering
both basic definitions and advanced topics, this book can be used
as a textbook in graduate courses in mathematical sciences, such as
discrete mathematics, combinatorics, and operations research, and
as a reference book for specialists in discrete mathematics and its
applications.
Algorithmic Aspects of Graph Connectivity is the first
comprehensive book on this central notion in graph and network
theory, emphasizing its algorithmic aspects. Because of its wide
applications in the fields of communication, transportation, and
production, graph connectivity has made tremendous algorithmic
progress under the influence of the theory of complexity and
algorithms in modern computer science. The book contains various
definitions of connectivity, including edge-connectivity and
vertex-connectivity, and their ramifications, as well as related
topics such as flows and cuts. The authors comprehensively discuss
new concepts and algorithms that allow for quicker and more
efficient computing, such as maximum adjacency ordering of
vertices. Covering both basic definitions and advanced topics, this
book can be used as a textbook in graduate courses in mathematical
sciences, such as discrete mathematics, combinatorics, and
operations research, and as a reference book for specialists in
discrete mathematics and its applications.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Southpaw
Jake Gyllenhaal, Forest Whitaker, …
DVD
R99
R24
Discovery Miles 240
Tenet
John David Washington, Robert Pattinson, …
DVD
R53
Discovery Miles 530
|