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

21-40 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)

Introduction to Graph Theory (2nd Edition) by Douglas B. West, 2000-09-01 Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 (London Mathematical Society Lecture Note Series) by Dragos Cvetkovic, Peter Rowlinson, et all 2004-08-16 A Beginner's Guide to Graph Theory by W.D. Wallis, 2007-06-08 Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92) by Fan R. K. Chung, 1996-12-03 Handbook of Graph Theory (Discrete Mathematics and Its Applications) Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications) by Jonathan L. Gross, Jay Yellen, 2005-09-22 Introduction to Graph and Hypergraph Theory by Vitaly I. Voloshin, 2009-04-01 Graph Theory As I Have Known It (Oxford Lecture Series in Mathematics and Its Applications) by W. T. Tutte, 1998-08-13 Topics in Graph Theory: Graphs and Their Cartesian Product by Wilfried Imrich, Sandi Klavzar, et all 2008-11-25 Power Systems Applications of Graph Theory (Energy Science, Engineering and Technology) by Jizhong Zhu, 2009-09-25 Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel, 2010-10-31 Algorithmic Graph Theory by Alan Gibbons, 1985-07-26 Groups, Graphs and Trees: An Introduction to the Geometry of Infinite Groups (London Mathematical Society Student Texts) by John Meier, 2008-09-15 Graphs and Applications: An Introductory Approach (with CD-ROM) by Joan M. Aldous, Robin J. Wilson, 2000-04-26

lists with details

21. Graph Theory - Wikipedia, The Free Encyclopedia
    graph theory is the branch of mathematics that examines the properties of graphs For more and formal definitions, see Glossary of graph theory and Graph (mathematics  
    http://www.wikipedia.org/wiki/Graph_theory
    
    Extractions: Other languages: Deutsch Esperanto Nederlands Polski ... Svenska From Wikipedia, the free encyclopedia. Graph theory is the branch of mathematics that examines the properties of graphs A graph with 6 vertices and 7 edges. Informally, a graph is a set of objects called vertices (or nodes) connected by links called edges (or arcs). Typically, a graph is depicted as a set of dots (i.e., vertices) connected by lines (i.e., edges). For more and formal definitions, see Glossary of graph theory and Graph (mathematics) Depending on the applications, edges may or may not have a direction; edges joining a vertex to itself may or may not be allowed, and vertices and/or edges may be assigned weights, that is, numbers. If the edges have a direction associated with them (indicated by an arrow in the graphical representation) then it is a directed graph , or digraph A graph with only one vertex and no edges is the trivial graph or "the dot" Structures that can be represented as graphs are ubiquitous, and many problems of practical interest can be formulated as questions about certain graphs. Various

22. Combinatorics/Number Theory RESEARCH DIRECTORY
    graph theory, combinatorial number theory.  
    http://www.math.tamu.edu/research/research_areas/cnt.html

23. Graph Theory
    Reinhard Diestel. graph theory. Second Edition. SpringerVerlag, NewYork Graduate Texts in Mathematics, Volume 173 Softcover $39.95  
    http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/

24.  An Overview On Graph Theory
    Leibniz Laboratory, The graph theory Team. An overview on graph theory.A graph is a very simple structure consisting of a set of  
    http://www-leibniz.imag.fr/GRAPH/english/overview.html
    
    Extractions: Home Members References Our topics ... Our software A graph is a very simple structure consisting of a set of vertices and a family of lines (possibly oriented), called edges (undirected) or arcs (directed), each of them linking some pair of vertices. An undirected graph may for example model conflicts between objects or persons. A directed graph (or digraph) may typically represent a communication network , or some domination relation between individuals, etc. The famous problem of the The number of concepts that can be defined on graphs is very large, and many generate deep problems or famous conjectures (for instance the four colour problem ). In fact, many of these concepts or theoretical questions arise from practical reasons (and not just from the mathematicians' imaginations) for solving real problems modeled on graphs. Moreover, researchers in Graph Theory try if possible to find efficient algorithms for solving these problems. The main classical problems in Graph Theory are : flow and connectivity (network reliability)

25. Homepage Of Sebastien Roch - Page Personnelle De Sébastien Roch
    Ecole Polytechnique, Montreal. Research interests combinatorial optimization, approximation algorithms, graph theory, mathematical programming, probability.  
    http://www.gerad.ca/~sroch

26. EIDMA Home Page
    Discrete Algebra and Geometry, Coding Theory, Information Theory and Cryptology, Combinatorial Optimization and Algorithms, graph theory.  
    http://www.win.tue.nl/math/eidma/

27. Ultrafast Parallel Algorithms And Reconfigurable Meshes
    Links to an online paper by Quentin F. Stout. Algorithms have been developed for problems in geometry, graph theory, arithmetic, sorting, and image processing.  
    http://www.eecs.umich.edu/~qstout/abs/DARPA92.html
    
    Extractions: EECS Department, University of Michigan Abstract: This survey paper describes our research in the development of very fast parallel algorithms, ones faster than those available through normal programming techniques or standard parallel computers. Algorithms have been developed for problems in geometry, graph theory, arithmetic, sorting, and image processing. The computing models that these algorithms have been developed for are concurrent read concurrent write parallel random access machines ( CRCW PRAMs ), and reconfigurable meshes ( rmeshes For CRCW PRAMS, our work has shown that by combining randomization with the use of some extra memory, one can solve some problems far faster than they can be solved if only randomization is used. We have developed ultrafast algorithms for several problems, where by ultrafast parallel algorithm we mean a parallel algorithm with an input of size n which uses at most a linear number of processors and finishes in poly-loglog time, i.e., in time O((loglog n k ) time for some k > 0. A particularly important ultrafast algorithm is

28. Gupta, Shyam
    Indian Institute of Technology, Delhi Databases and Data Mining, graph theory, Computer Vision  
    http://www.cse.iitd.ernet.in/~skg

29. Dr. Huzur Saran Homepage
    Indian Institute of Technology, Delhi High Speed Networks, graph theory, Algorithms  
    http://www.cse.iitd.ernet.in/~saran

30. Bibliography On The Solution Of Sparse Linear Systems And Related Areas Of Compu
    With emphasis on Computational Linear Algebra, High Performance Computing, Mathematical Programming and graph theory. Searchable.  
    http://liinwww.ira.uka.de/bibliography/Math/sparse.linear.systems.html
    
    Extractions: Computer Science Bibliographies Up: Bibliographies on Mathematics Collection Home Bibliography on the Solution of Sparse Linear Systems and Related Areas of Computation About Browse Statistics Number of references: Last update: September 28, 2001 Number of online publications: Supported: yes Most recent reference: September 1997 Search the Bibliography Query: Options case insensitive Case Sensitive partial word(s) exact online papers only Results Citation BibTeX Count Only Maximum of matches Help on: [ Syntax Options Improving your query Query examples Brazil Abstract: This bibliography includes references on the Solution of Sparse Linear Systems, and Related Areas of Computation, with emphasis on: Computational Linear Algebra, High Performance Computing, Mathematical Programming, Graph Theory. Keywords: Sparse Linear Systems, Direct Methods, Computational Linear Algebra, High Performance Computing

31. Graphs: Theory - Algorithms - Complexity
    Topics. Tutorials Glossaries, Glossary of some basic graph theoretic terms StephenC. Locke, Florida; graph theory Tutorials and Glossary Chris K. Caldwell  
    http://people.freenet.de/Emden-Weinert/graphs.html
    
    Extractions: This page collects information about graphs (here is a definition ) and pointers to corresponding web resources. Supplementing, comments and suggestions are most welcome! Please inform me about expired links. Many thanks to Laurence Pelletier, P. Ossona de Mendez, Victor Jimenez, and Pablo Moscato for contributions. Contents: Problem session of the International Colloquium on Extremal Graph Theory (Balatonlelle, Hungary, July 27 - August 2, 1997) , by Fan Chung Douglas West 's Open Problem Columns Problems in Topological graph theory , compiled by Dan Archdeacon (Vermont) (local copy as of August 1995

32. A Constructive Approach To Graph Theory
    Notes on a semiotic approach to constructing isomorphism invariants of graphs by JohnTagore Tevet.  
    http://www.hot.ee/tewet/

33. Graph Theory - Wikipedia, The Free Encyclopedia
    graph theory. From Wikipedia, the free encyclopedia. graph theory is the branchof mathematics that examines the properties of graphs. Image6ngraf.png.  
    http://en.wikipedia.org/wiki/Graph_theory
    
    Extractions: Other languages: Deutsch Esperanto Nederlands Polski ... Svenska From Wikipedia, the free encyclopedia. Graph theory is the branch of mathematics that examines the properties of graphs A graph with 6 vertices and 7 edges. Informally, a graph is a set of objects called vertices (or nodes) connected by links called edges (or arcs). Typically, a graph is depicted as a set of dots (i.e., vertices) connected by lines (i.e., edges). For more and formal definitions, see Glossary of graph theory and Graph (mathematics) Depending on the applications, edges may or may not have a direction; edges joining a vertex to itself may or may not be allowed, and vertices and/or edges may be assigned weights, that is, numbers. If the edges have a direction associated with them (indicated by an arrow in the graphical representation) then it is a directed graph , or digraph A graph with only one vertex and no edges is the trivial graph or "the dot" Structures that can be represented as graphs are ubiquitous, and many problems of practical interest can be formulated as questions about certain graphs. Various

34. NBA Player Connection
    Mathmatical player connection. The CGI program is based on basic concepts of graph theory, which is an area of Mathematics and Computer Science.  
    http://www.math.uaa.alaska.edu/~afkjm/nbamain.html

35. Diwan, Ajit
    Indian Institute of Technology, Bombay Algorithms, graph theory, Combinatorics  
    http://www.cse.iitb.ernet.in/~aad/

36. The Graph Theory Team
    Leibniz Laboratory, The graph theory Team. get acquainted with the membersof the graph theory team;; take a look at our overview on graph theory;;  
    http://www-leibniz.imag.fr/GRAPH/english/welcome.html

37. DIMACS Workshop On Geometric Graph Theory
    DIMACS Workshop on Geometric graph theory. September 30 October 4,2002 DIMACS Center, Rutgers University, Piscataway, New Jersey.  
    http://dimacs.rutgers.edu/Workshops/GeometricGraph/
    
    Extractions: DIMACS partner institution employees** DIMACS long-term visitors*** Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee during the course of the workshop. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable) * College/University faculty and employees of non-profit organizations will automatically receive the reduced rate. Other participants may apply for a

38. Institute For Theoretical Computer Science
    ETH, Zurich. The members are active in teaching and research in topics including design and analysis of algorithms, in particular in graph theory and computational geometry; data structures, in particular for spatial data; computability and complexity; information security and cryptography; and parallel computation.  
    http://www.inf.ethz.ch/department/TI/

39. LITQ
    Publications, laboratory staff members, and Java applets related to quantum cryptography, quantum information, quantum teleportation, computational complexity, algorithmics, and graph theory.  
    http://www.iro.umontreal.ca/labs/theorique/

40. Journal Of Graph Theory
    Journal of graph theory. The Editorsin-Chief of the Journal of GraphTheory are Paul Seymour and Carsten Thomassen. The Managing  
    http://www.emba.uvm.edu/~jgt/
    
    Extractions: The Editors-in-Chief of the Journal of Graph Theory are Paul Seymour and Carsten Thomassen. The Managing Editors are Dan Archdeacon, Genghua Fan, and Bruce Richter. The journal is published by John Wiley and Sons , who maintain a separate Journal of Graph Theory home page Papers can be submitted to: Dan Archdeacon

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

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