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

In Proc. DARPA Sortware Technology Conference 1992 , pp. 184-188. Ultrafast Parallel Algorithms and Reconfigurable Meshes Quentin F. Stout EECS Department, University of Michigan Abstract: This research is concerned with 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 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((log log n)

22. DIMACS Workshop On Geometric Graph Theory DIMACS Center, Rutgers University, Piscataway, NJ, USA; 30 September 4 October 2002.Category Science Math graph theory Events Past Conferences......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

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

24. Graph Theory Day 42 DIMACS Center, Rutgers University, Piscataway, NJ, USA; 10 November 2001.Category Science Math graph theory Events Past Conferences......graph theory Day 42. November 10, 2001 DIMACS Center, Rutgers University,Piscataway, New Jersey. Organizers Michael Gargano, Pace http://dimacs.rutgers.edu/Workshops/Graph/

Graph Theory Day 42 November 10, 2001 DIMACS Center, Rutgers University, Piscataway, New Jersey Organizers: Michael Gargano , Pace University, mgargano@pace.edu John W. Kennedy , Queens College, CUNY, jkennedy@nyas.org Louis V. Quintas , Pace University, lquintas@pace.edu Fred Roberts , Rutgers University, froberts@dimacs.rutgers.edu Mel Janowitz , Rutgers University, melj@dimacs.rutgers.edu Presented under the auspices of the DIMACS Special Focus on Data Analysis and Mining Co-Sponsored by DIMACS and the New York Academy of Sciences (NYAS) Workshop Announcement Call for Participation Program Registration Form There will be a modest registration fee of $25, and this includes lunch refreshments and a $5 contribution to the New York Academy of Sciences Graph Theory Fund. Lunch can be guaranteed only for advance registrants. Please make checks payable to: Rutgers University and send them to: DIMACS Center, Rutgers University, 96 Frelinghuysen Road, Piscataway, NJ 08854, Attention: Graph Theory Day 42. On-site registration will commence at 10:00am, accompanied by danish and coffee. The program begins at 10:30am. Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the event.

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

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

27. Games On Graphs A MegaMath presentation of basic concepts of graph theory.Category Science Math Combinatorics graph theory References......Overview. Graphs are mathematical objects that are made of dots connected by lines.graph theory is the branch of mathematics that involves the study of graphs. http://www.c3.lanl.gov/mega-math/workbk/graph/graph.html

Overview Graphs are mathematical objects that are made of dots connected by lines. Graph Theory is the branch of mathematics that involves the study of graphs. Graphs are very powerful tools for creating mathematical models of a wide variety of situations. Graph theory has been instrumental for analyzing and solving problems in areas as diverse as computer network design, urban planning, and molecular biology. Graph theory has been used to find the best way to route and schedule airplanes and invent a secret code that no one can crack. The Big Picture

28. Graph Theory And Constraint Programming University course definitions, lecture notes, books, language descriptions, links. http://www.cs.adfa.edu.au/~gtc/GTC/

Graph Theory and Constraint Programming The 1998 notes are available here Table of Contents General Course Information Some related web pointers Lectures Course Software ... rim@cs.adfa.edu.au Last Modified: 27 June 2000 jcmunro@bigpond.com

29. Graphs: Theory - Algorithms - Complexity Resource collection maintained by Thomas EmdenWeinert.Category Science Math Combinatorics graph theory...... 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

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

30. Problems In Topological Graph Theory Problems in Topological graph theory. Go to the Table of Contents. Returnto the Main Table of Contents. Random topological graph theory. http://www.emba.uvm.edu/~archdeac/problems/problems.html

Problems in Topological Graph Theory Go to the Table of Contents Compiled by Dan Archdeacon List Started: August 5, 1995 Converted to the web: September 1, 1998 Last modified: November 21, 1998 E-Mail: dan.archdeacon@uvm.edu Postal Mail: Dan Archdeacon Dept. of Math. and Stat. University of Vermon t Burlington VT 05401-1455 USA Abstract Do you think you've got problems? I know I do. This paper contains an ongoing list of open questions in topological graph theory. If you are interested in adding a problem to this list please contact me at the addresses above. The spirit is inclusive-don't submit a problem you're saving for your graduate student. If it appears here, it's fair game. If you solve one of the problems, know some additional history, or recognize it as misphrased or just a stupid question, please let me know so that I can keep the list up-to-date. I've taken quite a bit of liberty editing the submissions. I apologize for any errors introduced. Enjoy my problems-I do! Table of Contents Classical questions on genus Coloring graphs and maps Drawings and crossings Paths, cycles, and matchings ... Return to the Main Table of Contents The Problems Classical questions on genus The effect of edge deletion on the nonorientable genus Minor-minimal non-toroidal graphs Nearly triangular imbeddings of complete graphs Quadrilateral embeddings of composition graphs ... Return to the Main Table of Contents Coloring graphs and maps The earth-moon coloring problem Ringel's one-chromatic number of surfaces Tutte's nowhere-zero 4- and 5-flow conjectures Three edge-coloring orientable triangulations ... When are there local colorings?

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

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

Journal of Graph Theory 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 The Journal of Graph Theory Department of Mathematics and Statistics University of Vermont Burlington, VT 05401-1455 USA E-mail Dan Archdeacon at jgt.uvm.edu for more information.

33. UMR ECE- Dr. Donald C. Wunsch II Reinforcement Learning, Adaptive Critic Designs, Control, Optimization, graph theory, Bioinformatics, Intrusion Detection. http://www.ece.umr.edu/~dwunsch/

Dr. Donald C. Wunsch II Mary K. Finley Missouri Distinguished Professor of Computer Engineering Available Information Resume Biosketch and personal web page Office Address, Phone Number Link to Applied Computational Intelligence Laboratory ... Contact Web Page Administrator

34. (Switzerland) École Polytechnique Fédérale De Lausanne Chair of Operational Research South East (ROSE). The operational research group of EPFL deals with graph theory, evolutive algorithms, arc routine problems, scheduling, algorithmics, neural networks and other problems in the field of operational research. http://dmawww.epfl.ch/rose.mosaic/start.html

English Deutsch English Deutsch

35. Graph Theory And Discrete Geometry Manila 2001 A Conference in Honor of Frank Harary on his 80th Year. Ateneo de Manila University, Quezon City, Category Science Math graph theory Events Past Conferences......SCHEDULE SPEAKERS. REGISTRATION. ACCOMMODATIONS. POSTCONFERENCE TOURS. PROCEEDINGS.ARRIVAL INFORMATION. PHOTO GALLERY. SPONSORS Ateneo de Manila University. http://www.math.admu.edu.ph/CGTDG2001/

SCHEDULE SPEAKERS REGISTRATION ACCOMMODATIONS ... PHOTO GALLERY SPONSORS Ateneo de Manila University Commission on Higher Education (CHED, Phils.) Fujitsu, Philippines Manulife Financial Mathematical Society of the Philippines Software Ventures International Corporation Tokai University UNESCO s="na";c="na";j="na";f=""+escape(document.referrer) since April 27, 2001 PHOTO GALLERY Selected pictures taken during the conference are now posted. CONFERENCE PROCEEDINGS The proceedings of the conference will be published as a volume of Graphs and Combinatorics. Papers will be refereed in keeping with the standards of the journal. The paper should be 8 pages or less and should follow the format which you can find in the website of the journal Graphs and Combinatorics . Deadline for submission of the full paper: October 17, 2001. Please submit 3 copies of the paper. ORGANIZING COMMITTEE Jin Akiyama Research Institute of Educational Development Tokai University Mikio Kano Department of Computer and Information Science Ibaraki University Agnes D. Garciano

36. Discussiones Mathematicae Discussiones Mathematicae General Algebra and Applications. Discussiones Mathematicaegraph theory. Discussiones Mathematicae Probability and Statistics. http://www.pz.zgora.pl/discuss/

Discussiones Mathematicae. Differential Inclusions Control and Optimization Discussiones Mathematicae - General Algebra and Applications Discussiones Mathematicae Graph Theory Discussiones Mathematicae. Differential Inclusions Control and Optimization Discussiones Mathematicae - General Algebra and Applications Discussiones Mathematicae Graph Theory ... Discussiones Mathematicae Probability and Statistics

37. Graph Theory Conference 2000 - Kalamazoo, Michigan The 9th Quadrennial International Conference on graph theory, Combinatorics, Algorithms and Applications Category Science Math graph theory Events Past Conferences...... http://www.wmich.edu/graftheo/gtc2000.html

38. Colorful Mathematics Educational software presents advanced mathematics to K12 students in a game-oriented approach, using coloring and drawing techniques to illustrate concepts from graph theory and computer science. http://www.math.ucalgary.ca/~laf/colorful/colorful.html

COLORFUL MATHEMATICS Mathematics computer games Colorful Mathematics is a series of educational software presenting advanced mathematical concepts to K-12 students in a game-oriented approach. The five games offered utilize simple coloring and/or drawing techniques to illustrate some state of the art mathematical concepts from graph theory and computer science. BACKGROUND IS THIS REALLY MATHEMATICS? THE GAMES TEACHER'S CORNER ... RELATED SITES Funding for this project was made possible through Industry Canada's SchoolNet initiative and through the cooperation of the Canadian Mathematical Society. Chosen as a Selected Web Resource by the National Council of Teachers of Mathematics Illuminations Project

39.  An Overview On Graph Theory Definitions and classical problems.Category Science Math Combinatorics graph theory References......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)

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

Home Research Education People ... Werner Hartmann, Senior Scientist 23-Aug-2002 / webti@inf.ethz.ch

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