Home  - Science - Graph Theory

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

61-80 of 165    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Graph Theory:     more books (100)

A First Look at Graph Theory by John Clark, Derek Allan Holton, 1991-05 Graph Algebra: Mathematical Modeling With a Systems Approach (Quantitative Applications in the Social Sciences) Graphs & Digraphs, Fifth Edition by Gary Chartrand, Linda Lesniak, et all 2010-10-18 Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ® by Sriram Pemmaraju, Steven Skiena, 2009-10-15 Laplacian Eigenvectors of Graphs: Perron-Frobenius and Faber-Krahn Type Theorems (Lecture Notes in Mathematics) by Türker Biyikoglu, Josef Leydold, et all 2007-09-10 Introduction To Graph Theory by Khee Meng Koh, 2007-10-12 Graph Drawing: Algorithms for the Visualization of Graphs by Ioannis G. Tollis, Giuseppe Di Battista, et all 1998-07-23 Random Graphs by Béla Bollobás, 2001-09-15 Perfect Graphs by J.L.R. Alfonsin, 2001-09-15 Set Theory for the Working Mathematician (London Mathematical Society Student Texts) by Krzysztof Ciesielski, 1997-08-28 Graph Theory and Combinatorial Optimization Chromatic Graph Theory (Discrete Mathematics and Its Applications) by Gary Chartrand, Ping Zhang, 2008-09-22 Algorithms in C++ Part 5: Graph Algorithms (3rd Edition) (Pt.5) by Robert Sedgewick, 2002-01-06 Probability Theory and Combinatorial Optimization (CBMS-NSF Regional Conference Series in Applied Mathematics) by J. Michael Steele, 1987-01-01

lists with details

61. Graph Theory 2004: A Conference In Memory Of Claude Berge
    graph theory 2004 a conference in memory of Claude Berge. Paris, July 59,2004. Paris, 1990 © Adrian Bondy. A conference dedicated to the memory of  
    http://www.ecp6.jussieu.fr/GT04/
    
    Extractions: will be held July 5 - 9, 2004, in Paris at the . The main focus of the conference is graph theory, with particular emphasis on the topics to which Claude Berge contributed. PLENARY LECTURES These will be expository lectures addressed to a broad mathematical audience. Among the plenary speakers will be Vašek Chvátal

62. Graph Theory 2004. A Conference In Memory Of Claude Berge
    graph theory 2004 A Conference in Memory of Claude Berge. Paris, July 59, 2004.Preliminary Announcement. The main topic of the conference is graph theory.  
    http://www.ecp6.jussieu.fr/GT04/GT04b.html

63. GraphThing Home Page
    Tool for investigating graph theory, with a GTK interface. Free under GPL. Unix, source code in C++.  
    http://graph.seul.org/
    
    Extractions: What is GraphThing Is it free? Latest News ... Mailing List GraphThing is a tool that allows you to create, manipulate and study graphs. These "graphs" are mathematical objects (look at this introduction to Graph Theory ) that describe relationships between sets; they are not 2D plots, charts, or anything similar to that. If the image on the right means nothing to you, you're probably at the wrong place. GraphThing is Free Software , licensed under the terms of the GNU GPL . That means that not only does it cost you nothing , but you also have the freedom to redistribute it or modify it however you please, so long as you also give these freedoms to others. As an example, the CityBuilder project has taken a particular version of GraphThing, and modified it for their own needs. They have released the source code to their forked version under the GNU GPL. If you find GraphThing useful, especially in either an educational or academic setting, please email me and tell me your thoughts about it!

64. Graph Theory And Combinatorics
    Translate this page Combinatorics, graph theory and Applications group, Applied Mathematicsdepartment, Polytechnical University of Catalonia - UPC, DMAT.  
    http://maite71.upc.es/grup_de_grafs/

65. Fourth Cracow Conference On Graph Theory "Czorsztyn '02"
    of Applied Mathematics University of Mining and Metallurgy in Cracow has organizedFOURTH CRACOW CONFERENCE ON graph theory CZORSZTYN 02 Czorsztyn, Poland  
    http://galaxy.uci.agh.edu.pl/~graphs/

66. Fifth Slovenian International Conference On Graph Theory
    Fifth Slovenian International Conference On graph theory. June 2227, 2003,Bled, Slovenia. Last updated 19. 6. 2003 (program slightly updated)  
    http://www.educa.fmf.uni-lj.si/matjaz/bled/
    
    Extractions: The information on the following topics is available: IMPORTANT INSTRUCTIONS Payment of registration fee (for foreign participants), hotel and transfer reservations are handled by agency Albatros Bled . Registration for the conference is handled by the organizers. Registration: If you want to take part at the conference, please register here Payment (foreign participants): To pay the conference fee, please use Albatros form . Payment options are credit card payment and bank transfer. To receive early registration fee, the fee must be paid before May 15, 2003. Participants from Slovenia are adviced to contact the organizers about payment details. Hotels: If you want to stay in one of the conference hotels, make a reservation through

67. Gregory Gutin, TSP, Combinatorial Optimization, Digraphs
    Royal Holloway, University of London. graph theory and algorithms, combinatorial optimisation, linear and integer programming.  
    http://www.cs.rhbnc.ac.uk/home/gutin/
    
    Extractions: CV Digraph Monograph Page DIMACS TSP Challenge RHUL Library ... Oper. Res. Lett. Gregory received his MSc in Mathematics in 1979 from Gomel State University, Belarus. He worked in high school and research institutes of Belarus from 1979-1990. He studied for PhD under Professor Noga Alon at the School of Mathematics, Tel Aviv University, Israel and received his PhD (with distinction) in 1993. Between 1993 and 1996 he held visiting positions in the Department of Mathematics and Computer Science, Odense University, Denmark and then became a lecturer at the Department of Mathematics, Brunel University, UK. Since 1 September 2000, Gregory has been Professor in Computer Science, Department of Computer Science, Royal Holloway. Gutin's main research interests include graph theory and algorithms, combinatorial optimisation, linear and integer programming. He has published more than sixty research papers, and a monograph : J. Bang-Jensen and G. Gutin, Digraphs. Theory, Algorithms and Applications. Springer-Verlag, London, 2000 (ISBN: 1-85233-268-9). He co-edited (with A.P. Punnen) a new TSP book : Traveling Salesman Problem and its Variations, Kluwer, 2002 (ISBN: 1-4020-0664-0). A preliminary version of Chapter 6 is available in

68. Boost Graph Library: Graph Theory Review
    Review of Elementary graph theory. This chapter is meant as a refresheron elementary graph theory. If the reader has some previous  
    http://www.boost.org/libs/graph/doc/graph_theory_review.html
    
    Extractions: This chapter is meant as a refresher on elementary graph theory. If the reader has some previous acquaintance with graph algorithms, this chapter should be enough to get started. If the reader has no previous background in graph algorithms we suggest a more thorough introduction such as Introduction to Algorithms by Cormen, Leiserson, and Rivest. A graph is a mathematical abstraction that is useful for solving many kinds of problems. Fundamentally, a graph consists of a set of vertices, and a set of edges, where an edge is something that connects two vertices in the graph. More precisely, a graph is a pair (V,E) , where V is a finite set and E is a binary relation on V V is called a vertex set whose elements are called vertices E is a collection of edges, where an edge is a pair (u,v) with u,v in V . In a directed graph , edges are ordered pairs, connecting a source vertex to a target vertex. In an undirected graph edges are unordered pairs and connect the two vertices in both directions, hence in an undirected graph (u,v)

69. Laboratory Of Research
    CNRS/Universit© de Paris Sud. Research Topics graph theory and principles of Network Communications, Algorithms and Complexity,Programming, Databases,Proofs and programs, Parallel Architecture, Parallelism, Artificial Intelligence and Inference systems (IASI),Inference and Learning.  
    http://www.lri.fr/introduction.en.shtml

70. Combinatorics, Probability & Computing
    (CUP) Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation. Contact information; full text to subscribers.  
    http://uk.cambridge.org/journals/cpc/
    
    Extractions: Now published bimonthly, is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

71. Home Page Of Subir Kumar Ghosh
    Tata Institute of Fundamental Research, Mumbai Computational Geometry and Applications, Robot Motion Planning, Geometric graph theory and Applications.  
    http://www.tcs.tifr.res.in/~ghosh/
    
    Extractions: Home Page of Subir Kumar Ghosh Professor School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road Mumbai 400005, India Telephone No :91-22- 2215 2971 Extn. 2546 (Office) 91-22- 2218 9563 (Residence) Fax No :91-22- 2215 2181 and 91-22- 22152110 E-Mail address : ghosh@tifr.res.in ghosh@tcs.tifr.res.in I am on my Sabbatical to the School of Computing Science, Simon Fraser University, Vancouver, Canada from May 1, 2003. Any mail to my TIFR e-mail address will be forwarded to my SFU account. Research Interests and Collaborators Curriculum Vitae List of Publications Citations

72. Mark Newman: Publications
    and DG Truhlar (eds.), Wiley, New York (1999). Networks and graph theory.Uniform generation of random graphs with arbitrary degree  
    http://www.santafe.edu/~mark/pubs.html
    
    Extractions: Modeling Extinction , M. E. J. Newman and R. G. Palmer, Oxford University Press (2003). Monte Carlo Methods in Statistical Physics M. E. J. Newman and G. T. Barkema, Oxford University Press (1999). The Theory of Critical Phenomena J. J. Binney, N. J. Dowrick, A. J. Fisher and M. E. J. Newman, Oxford University Press (1992). Who is the best connected scientist? A study of scientific coauthorship networks , M. E. J. Newman, to appear in Complex Networks , E. Ben-Naim, H. Frauenfelder, and Z. Toroczkai (eds.), Springer, Berlin (2004). The structure and function of complex networks , M. E. J. Newman, SIAM Review Random graphs as models of networks , M. E. J. Newman, in Handbook of Graphs and Networks , S. Bornholdt and H. G. Schuster (eds.), Wiley-VCH, Berlin (2003). Complex systems theory and evolution , Melanie Mitchell and Mark Newman, in the Encyclopedia of Evolution , M. Pagel (ed.), Oxford University Press, New York (2002). Patterns of extinction and biodiversity in the fossil record , R. V. Sole and M. E. J. Newman, in the Encyclopedia of Global Environmental Change

73. Bibliography On The Solution Of Sparse Linear Systems And Related Areas Of Compu
    More than 2000 selected references, covering the solution of sparse linear systems and related areas of computation, including computational linear algebra, high performance computing, mathematical programming and graph theory.  
    http://citeseer.nj.nec.com/arantes97bibliography.html
    
    Extractions: Abstract: This bibliographic list of references was originally compiled during the elaboration of my PhD thesis, and has been gradually expanded since them, counting now with more than 2000 selected references, covering the solution of sparse linear systems and related areas of computation, including: computational linear algebra, high performance computing, mathematical programming and graph theory. One additional aspect of this bibliography is the citation of a significant number of "classical"... (Update)

74. School Of Electrical Engineering And Computer Science, The University Of Newcast
    Department of Computer Science and Software Engineering. Research groups include data security, graph theory, information visualization, monetary systems engineering and virtual memory.  
    http://www.eng.newcastle.edu.au/eecs/

75. Topics In Intersection Graph Theory By TA McKee And FR McMorris
    Topics in Intersection graph theory by TA McKee and FR McMorris. Bibliographicinformation. Table of Contents. Topics in intersection graph theory.  
    http://www.math.wright.edu/People/Terry_McKee/Button_04_Book.html

76. Thirty-third Southeastern International Conference On Combinatorics, Graph Theor
    33rd Southeastern International Conference. Florida Atlantic University, Boca Raton, FL, USA; 48 March 2002.  
    http://www.math.fau.edu/cgtC/cgtc33/se33.html
    
    Extractions: Click here for Advanced Search The 33 rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing will be Mar 4-8, 2002 at Florida Atlantic University in Boca Raton, FL Conference registration and check-in will begin at 8:00 a.m. Monday, March 4, 2002 For the Thirty-third Conference, the following speakers will present instructional lectures:

77. M4408 - Applied Graph Theory
    therefore you are seeing this message), a nonframe version of the pageis available. Nonframe version of Applied graph theory homepage.  
    http://www-math.cudenver.edu/~wcherowi/courses/m4408/m4408f.html

78. Journal Of Combinatorial Theory - Series B
    The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.  
    http://www.elsevier.com/locate/issn/0095-8956
    
    Extractions: Home Site map picswapper("picswap", [/authored_framework/ + "images/topbar_1.jpg", /authored_framework/ + "images/topbar_2.jpg", /authored_framework/ + "images/topbar_3.jpg", /authored_framework/ + "images/topbar_4.jpg", /authored_framework/ + "images/topbar_5.jpg", /authored_framework/ + "images/topbar_6.jpg"], 5000) Advanced Product Search Products Journal of Combinatorial Theory, Series B Journal information Product description Editorial board Guide for authors Online submission ... Abstracting/indexing Subscription information Bibliographic and ordering information Conditions of sale Dispatch dates Journal related information Most downloaded articles Other journals in same subject area About Elsevier Select your view The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.

79. Applied Graph Theory - Non-Frame Index
    frames version Math 4408. Applied graph theory. Spring 2001. Index.Introduction; Syllabus; Lecture Notes; Glossary; Homework; Past Quizzes;  
    http://www-math.cudenver.edu/~wcherowi/courses/m4408/m4408.html

80. Pure Maths Research: Combinatorics
    Combinatorics Research Group. graph theory, design theory, history of combinatorics, combinatorial computing.  
    http://mcs.open.ac.uk/puremaths/pmd_research/pmd_combin.html
    
    Extractions: @import url(../styles.css); Research Analysis CHMS Combinatorics The Combinatorics Research Group comprises Professor Mike Grannell Professor Terry Griggs Dr Fred Holroyd , Roy Nelson, Dr Kathleen Quinn Dr Chris Rowley Dr Bridget Webb and Dr Robin Wilson and also several members of the Technology Faculty (Dr Alan Dolan, Dr Joe Rooney and Dr Jeff Johnson). Members are interested in The Group runs the Open University Winter Combinatorics Meeting near the end of January each year.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

61-80 of 165    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20