21. Graph Theory Lesson 8 graph theory Lessons. graphic graphic graphicLesson 8 Graph Coloring. Get the graph of a cube (it is under the Platonic Graph menu item). http://www.utc.edu/~cpmawata/petersen/lesson8.htm

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

Combinatorics/Number Theory Directory The main subareas of interest and the faculty connected with them are listed below. Some of these faculty have additional research interests Graph Theory Arthur Hobbs Analytic Number Theory Doug Hensley Combinatoric Number Theory Itshak Borosh Combinatorial Topology Laura Anderson Toric Varieties J. Maurice Rojas Hal Schenck Algebra Applied Mathematics ... Research Directory

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

Reinhard Diestel Graph Theory Second Edition Springer-Verlag, New York Graduate Texts in Mathematics, Volume 173 Softcover $39.95, ISBN 0-387-98976-5 Hardcover $69.95, ISBN 0-387-95014-1 February 2000 (May 1997) 312 pages; 122 figures Overview: Summary (blurb): edition Preface: edition (pdf) Contents Complete Electronic Edition: There is a free searchable and hyperlinked electronic edition of the book, which may be viewed on-line or downloaded for offline use. About the Book: Reviews Errata: edition About the Author: Summary of CV How to Order: Orders from the US, Canada and Mexico Orders from any other country 60-day Examination Copies for lecturers basing their course on the book German Edition Further Reading Home

24. The Graph Theory White Pages Translate this page The graph theory White Pages. maintained by Daniel P. Sanders as part of www.graphtheory.com Resources People Research Writings The http://www.cs.columbia.edu/~sanders/graphtheory/people/alphabetic.html

25.  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

Leibniz Laboratory, The Graph Theory Team Home Members References Our topics ... Our software An overview on Graph Theory 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)

26. 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

I moved to California. My new page is here

27. 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/

28. 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

Ultrafast Parallel Algorithms and Reconfigurable Meshes Quentin F. Stout 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

29. Unsolved Problems regular graphs without 3regular subgraphs.graph theory and its applications East and West Kotzig (see Bondy and Murty, graph theory with Applications, North-Holland, Amsterdam http://www.math.fau.edu/locke/unsolved.htm

Unsolved Problems You can contact Stephen C. Locke at LockeS@fau.edu Several people have asked me about unsolved problems. I will take the easy way out: see the list of 50 problems in Bondy and Murty . You can now see the list as it originally appeard in the the text, Graph Theory with Applications . (May, 2004: The authors are writing the next edition of the book.) Some of these problems have been solved (and thus the title is slightly incorrect) and I won't claim to be familiar with all current results. If you find that one of them has been solved (or even that some reasonable progress has been made), please e-mail me . Also, I'm not giving you all of the references in Bondy and Murty . You should get yourself a copy of that book (or look at the online version). Problems 26-56 Problems 57-61 Problems number above 50 on my list are from sources other than the Bondy and Murtry text. The reconstruction conjecture . (S.M. Ulam, 1960) 2. A graph G is embeddable in a graph H if G is isomorphic to a subgraph of H . Characterise the graphs embeddable in the k -cube. (V.V. Firsov, 1965)

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

Shyam Gupta Associate Professor Indian Institue of Technology, Delhi Hauz Khas, New Delhi 110016, INDIA. Email: skg@cse.iitd.ernet.in Telephone : Residence:+91-11-6591603 Office: +91-11-6591289 Research Interests Courses Some Recent Publications Projects ... Datamining Course Research Interests Top Databases and Data Mining Graph Theory Computer Vision Courses in Spring 1999 Top CS332N - Database Management Systems(DBMS) Courses in Fall 1999 CS482N/CS905N - Special Topics in Computer Applications, Data Mining Courses in Spring 2000 CS110N - An Introduction to Computers and Programming Courses in Fall 2000 CS331N - File Structures and Information Systems Design Recent Publications Top S.K.Gupta, Vasudha Bhatnagar, S. K. Wasan, User Centric Mining of Association Rules, Accepted in DDMI Workshop, PKDD 2000, Lyons, France, September 13-16 2000. Springer-Verlag Postscript S.K.Gupta, Vasudha Bhatnagar, S. K. Wasan and DVLN Somayajulu, Intension Mining: A New Paradigm in Knowledge Discovery Technical Report No. IITD/CSE/TR2000/001 , March 2000 Postscript S.K.Gupta and Amrinder Singh

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

To View this page you are required to have a frames compatible browser since you donot have one so CLICK HERE

32. 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

The Collection of 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 Boolean operators: and and or . Use to group boolean subexpressions. Example: (specification or verification) and asynchronous Information on the Bibliography Author: Dr. Ricardo Duarte Arantes (email mangled to prevent spamming) National Laboratory for Scientific Computation Rua Lauro Muller, 455, Botafogo 22290-160, Rio de Janeiro 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

33. Graphs: Theory - Algorithms - Complexity Topics. Tutorials Glossaries, Glossary of some basic graph theoretic terms Stephen C. Locke, Florida; graph theory Tutorials and Glossary Chris K. Caldwell http://people.freenet.de/Emden-Weinert/graphs.html

Graphs Theory - Algorithms - Complexity 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: Related Link Collections Online Forums Open Problems Topics ... People Related Link Collections Graph Theory Resources [D.P. Sanders] Graph Theory [Rob Pratt, University of North Carolina] Michael Trick's Operations Research Page Dictionary of Algorithms, Data Structures, and Problems Online Forums GRAPHNET a mailing list distributing conference announcements, problems etc. ORCS-L : the Operations Research - Computer Science Interface Open Problems 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

34. 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/

A CONSTRUCTIVE APPROACH TO GRAPH THEORY Title General Results Complementary data ... In Russian

35. Graph Theory - Wikipedia, The Free Encyclopedia graph theory. From Wikipedia, the free encyclopedia. graph theory is the branch of mathematics that examines the properties of graphs. Image6ngraf.png. http://en.wikipedia.org/wiki/Graph_theory

Graph theory 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 networks are conveniently described by means of graphs. For example, the link structure of

36. 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

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

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

Leibniz Laboratory, The Graph Theory Team Members Overview References Our topics ... Our software This is the home page of the graph theory team of the Leibniz Laboratory (part of the IMAG Institute , Grenoble, France). From here you can: get acquainted with the members of the graph theory team take a look at our overview on Graph Theory look up a list of general references on Graph Theory; peek at our research topics see the software developed by some member(s) of the team. Winter school : New Methods in Discrete Mathematics Thanks for your visit!

39. 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/

DIMACS Workshop on Geometric Graph Theory September 30 - October 4, 2002 DIMACS Center, Rutgers University, Piscataway, New Jersey Organizer: Janos Pach , City College and Courant Institute, New York, pach@cims.nyu.edu Presented under the auspices of the Special Focus on Computational Geometry and Applications Workshop Announcement Call for Participation Program ... Registration Form (Preregistration deadline: September 23, 2002) Presentation Slides DIMACS Workshop Registration Fees Preregister before deadline After preregistration deadline Regular rate (1 day/2 days/3 days/4 days/5 days) Academic/nonprofit rate* Postdocs $10/day $15/day DIMACS Postdocs $5/day $10/day 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

40. 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/

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