81. Patrice Ossona De Mendez Ecole des Hautes Etudes en Sciences Sociales, Paris. Topological graph theory; Combinatorics; Pliant programming. http://www.ehess.fr/centres/cams/person/pom/index.html

Patrice Ossona de Mendez CAMS CNRS UMR 8557 École des Hautes Études en Sciences Sociales 54 Boulevard Raspail, 75006 Paris - FRANCE pom@ehess.fr Retour au CAMS Back to CAMS Bibliographie Bibliography ... Cours de DEA (french only) Mes principaux centres d'intérêt en mathématiques sont: les graphes topologiques, la combinatoire, les algorithmes. My main mathematical interests are: Topological Graph theory, Combinatorics, Algorithms. Principaux axes de recherche J'ai soutenu en 1994 une thèse portant sur l'étude des orientations bipolaires. L'étude de ces orientations et des décompositions de Schnyder d'un graphe planaire en 3 arbres nous ont amenés, Hubert de Fraysseix et moi-même, à étudier les orientations à degré entrant borné. De cette étude ont émergé un certain nombre de résultats liant les propriétés topologiques d'un graphe à ses orientations contraintes. Cette recherche a rejoint celle que nous avions débuté sur la conjecture qui affirme que tout graphe planaire est le graphe d'intersection d'une famille de segments du plan. Dans ce domaine, Hubert, János Pach et moi-même avons tout d'abord démontré que tout graphe planaire biparti est le graphe de contact d'une famille de segments horizontaux et verticaux. Hubert et moi-même avons poursuivi cette étude des représentations par contacts et avons prouvé qu'une importante classe de graphes planaires (graphes planaires 4 coloriables sans C

82. Statistics, Operational Research And Probabilistic Methods Research Centre Research and courses in linear and additive models, queueing theory and reliability, combinatorial optimisation, graph theory, and the underrepresentation of working class students in Higher Education. http://www.unl.ac.uk/storm/

Skip over navigation Find a Course Site Help Search Site document.write(''); About us Study Life Staff ... International You are here: Home Site Help New WWW Site Help How to use this site Site A-Z Accessibility Statement Browser Advice ... Terms and Conditions of Use New WWW You have been directed to the London Metropolitan University website because you tried to access a page on www.lgu.ac.uk or www.unl.ac.uk London Metropolitan University was formed following the merger of the University of North London (UNL) and London Guildhall University (LGU) in August 2002. On 2 February 2004, public access to the precursor institution websites ended. The aim of this page is to help you locate resources previously found on either the old LGU or UNL websites. If you cannot find information using the site's own navigation, please try the following methods: Site A-Z BROWSE THE SITE A-Z . This comprehensive list covers the main areas of our website, alphabetised for your convenience. Search Engine Try searching for information on the LondonMet website using keywords. You'll find a search box at the top of most of our pages.

83. Introductory Graph Theory Introductory graph theory. By Gary Chartrand. Western Michigan University. Networksas Mathematical Models. Chapter 2 Elementary Concepts of graph theory. http://www.wmich.edu/math-stat/people/faculty/chartrand/introgt/

Introductory Graph Theory By Gary Chartrand Western Michigan University Published by Dover Paperbacks About the Book Table of Contents Chapter 1: Mathematical Models Nonmathematical Models Mathematical Models Graphs Graphs as Mathematical Models Directed Graphs as Mathematical Models Networks as Mathematical Models Chapter 2: Elementary Concepts of Graph Theory The Degree of a Vertex Isomorphic Graphs Connected Graphs Cut-Vertices and Bridges Chapter 3: Transportation Problems The Konigsberg Bridge Problem: An Introduction to Eulerian Graphs The Salesman's Problem: An Introduction to Hamiltonian Grpahs Chapter 4: Connection Problems The Minimal Connector Problem: An Introduction to Trees Trees and Probability PERT and the Critical Path Method Chapter 5: Party Problems The Problem of Eccentric Hosts: An Introduction to Ramsey Numbers The Dancing Problem: An Introduction to Matching Chapter 6: Games and Puzzles The Problem of the Four Multicolored Cubes: A Solution to "Instant Insanity" The Knight's Tour The Tower of Hanoi The Three Cannibals and Three Missionaries Problem Chapter 7: Digraphs and Mathematical Models A Traffic System Problem: An Introduction to Orientable Graphs Tournaments Paired Comparisons and How to Fix Elections Chapter 8: Graphs and Social Psychology The Problem of Balance The Problem of Clustering Graphs and Transactional Analysis Chapter 9: Planar Graphs and Coloring Problems The Three Houses and Three Utilities Problem: An Introduction to Planar Graphs

84. Workshop On Computational Graph Theory And Combinatorics Workshop on Computational graph theory and Combinatorics. The Pacific Northwest area is an important center for research in graph theory and combinatorics. http://www.math.uvic.ca/~wcgtc/wcgtc.html

Workshop on Computational Graph Theory and Combinatorics This workshop will be held May 6-8, 1999, at the campus of the University of Victoria , in Victoria, British Columbia, CANADA. NEW: Group photo Group photo Group photo Organizers ... Parking Information and Campus Map NOTE: Please pre-register if you are planning on attending. Organizers Wendy Myrvold and Frank Ruskey Department of Computer Science , University of Victoria. Objectives The "Pacific Northwest" area is an important center for research in graph theory and combinatorics. Computer techniques are becoming ever more critical as an aid in approaching research problems. The aim of this workshop is to bring together leading experts, interested researchers, postdocs and graduate students to share their expertise in applying computational techniques to graph theory and combinatorics problems. Contributed sessions will focus on ways in which research in discrete mathematics has been aided by computational techniques. Invited Speakers The following speakers will present one hour talks. Herbert S. Wilf, University of Pennsylvannia

85. Feedback Form Dedicated to Professor Henda C. Swart and Professor Izak Broere, the pioneers of graph theory in South Africa. Ntshondwe Camp, Ithala Game Reserve, KwaZuluNatal, South Africa; 1822 June 2001. http://saturn.cs.unp.ac.za/saigtc/saigtcf.html

South African International Graph Theory Conference June 18-22, 2001 To be held at Ntshondwe Camp, Ithala Game Reserve, KwaZulu-Natal, South Africa Hosted by University of Natal The South African International Graph Theory Conference is to be held during June 18-22, 2001 and is dedicated to Professor Henda C. Swart and Professor Izak Broere, the pioneers of graph theory in South Africa. The conference will be held at Ntshondwe Camp, Ithala Game Reserve , situated in KwaZulu-Natal, South Africa and hosted by the University of Natal. The main goal of the conference is to explore the most recent research in graph theory. The Principal Talks will be scheduled for 25 minutes and contributed talks for 15 minutes. Special functions during the week includes a night drive in open safari vehicles, breakfast at the Bird Hide, sundowners overlooking the beautiful Phongola River, a night bush braai (alias ''barbeque'') and a Zulu dancing exhibition. The Principal Speakers are: Professor Lowell Beineke, Indiana University-Purdue University, USA

86. Graph Theory Of Brian Alspach - Simon Fraser Univ. - 2003 Simon Fraser University, Burnaby, BC, Canada; 2529 May 2003. http://www.cs.uleth.ca/gtba/

Your browser is not frames capable. See no-frame version of this page.

87. American Scientist Online - Graph Theory In Practice: Part I graph theory in Practice Part I. The diameter in question is not a geometric distance;the concept comes from the branch of mathematics called graph theory. http://www.americanscientist.org/template/AssetDetail/assetid/14708

Home Current Issue Archives Bookshelf ... Subscribe In This Section Search Book Reviews by Issue Issue Index Topical Index ... Classics Site Search Advanced Search Visitor Login Username Password Help with login Forgot your password? Change your username see full issue: January-February 2000 Volume: Number: Page: DOI: COMPUTING SCIENCE Other Formats: Postscript (gzipped) Postscript PDF Graph Theory in Practice: Part I Brian Hayes What is the diameter of the World Wide Web? The answer is not et al. find that if you know where you're going, you can get just about anywhere in 19 clicks of the mouse. Continued Article Tools printer friendly request classroom permission e-mail this article Of Possible Interest Column: How to Avoid Yourself Column: Prototeins Column: Experimental Lamarckism Column: On the Threshold Column: Dividing the Continent About American Scientist Site Map ... Contact Us

88. Seventh North Carolina Mini-Conference Appalachian State University, Boone, NC, USA; 12 April 2002. http://www.cs.appstate.edu/~aam/Conference2002/

Friday, April 12, 2002 The Departments of Computer Science and Mathematical Sciences at Appalachian State University are pleased to announce the Seventh North Carolina Mini-Conference on Graph Theory, Combinatorics, and Computing. The conference will be held on Friday, April 12th, 2002. We have a preliminary schedule of talks. The conference will be held at the Plemmons Student Union Building (note: this is different from last year). Parking is available at First Baptist Church on King Street (hang tags are needed). We plan to have someone in the church lot to direct parking and give out hang tags. One of the goals of this conference is to provide a venue in which students can present their work, and so we especially encourage students (undergraduate and graduate) to consider giving talks. Each speaker will have 20 minutes for his/her presentation with 5 additional minutes for questions. A conference luncheon will take place again this year. During the luncheon, participants will have the opportunity to interact with one another discussing areas of common interest and making valuable connections with others in our region. The luncheon will be free for everyone who has registered before April 8th. After lunch we will hear from our featured speaker, Peter Slater, professor of mathematics at the University of Alabama(Huntsville). Our aim is for this conference to be beneficial to both the students and the faculty of our region. We hope that you will be able to be with us on this day, and we hope that you will encourage others to attend.

89. American Scientist Online - Graph Theory In Practice: Part II 2000.2.104. COMPUTING SCIENCE. Other Formats Postscript (gzipped)Postscript. graph theory in Practice Part II. Brian Hayes. Part I http://www.americanscientist.org/template/AssetDetail/assetid/14717

Home Current Issue Archives Bookshelf ... Subscribe In This Section Search Book Reviews by Issue Issue Index Topical Index ... Classics Site Search Advanced Search Visitor Login Username Password Help with login Forgot your password? Change your username see full issue: March-April 2000 Volume: Number: Page: DOI: COMPUTING SCIENCE Other Formats: Postscript (gzipped) Postscript Graph Theory in Practice: Part II Brian Hayes Part I of this article, in the January-February issue, discussed some very large structures that can usefully be looked upon as mathematical graphs. In this context a graph is a set of vertices (which are usually represented as dots) and a set of edges (lines between the dots). One large object that can be described in this way is the World Wide Web; its 800 million pages are the vertices of a graph, and links from one page to another are the edges. A second example comes out of Hollywood: The vertices are 225,000 actors, and an edge connects any two actors who have appeared in a feature film together. Although graph theory has a history of two centuries and more, only in recent years has it been applied routinely to structures like these, with many thousands or millions of vertices and edges. Studying such enormous graphs is by no means easy. The Hollywood collaboration graph just barely fits in the memory of a large computer. The Web, a few orders of magnitude larger, requires all the resources of the Internet to keep track of its tentacles. Certain other graphs are even bigger. The human acquaintanceship graph, with a vertex for every person on earth and edges linking all those who know each other, may never be recorded beyond a few small, sampled regions.

90. The Electronic Journal Of Combinatorics A refereed allelectronic journal that welcomes papers in all branches of discrete mathematics, including all kinds of combinatorics, graph theory, discrete algorithms. Full text is available free on-line. http://www.combinatorics.org/

The Electronic Journal of Combinatorics If you are reading this, you must be either very clever or be using a browser that doesn't support frames. Please click here to continue.

91. Graph Theory next up previous index Next Covering and Partitioning Up A compendium ofNP Previous Improving the compendium Index graph theory. graph theory http://www.nada.kth.se/~viggo/wwwcompendium/node8.html

Next: Covering and Partitioning Up: A compendium of NP Previous: Improving the compendium Index Graph Theory Graph Theory Covering and Partitioning M INIMUM V ... NFERENCE Viggo Kann

92. Cabri-graph/cabri Free Macintosh software for graph theory. http://www-cabri.imag.fr/CabriGraphes/cabri_anglais/gb_cabri_graph.html

93. Satellite Conference Of ICM-2002 Hong Kong University of Science and Technology; 1517 August 2002. http://www.math.ust.hk/conference/

Combinatorics, Graph Theory and Applications Satellite Conference of ICM-2002 15-17 August 2002 Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong The conference is to provide an opportunity for people to discuss the most recent ideas and advances in combinatorics and graph theory. Topics range from traditional problems to new directions, applications, and interactions with other fields. Confirmed Speakers: Noga Alon Tel Aviv, Israel Bela Bollobas Cambridge, UK; Memphis, USA Christian Borgs Microsoft, USA Jennifer Chayes Microsoft, USA W.T. Gowers Cambridge, UK; Princeton, US Gyula Katona Renyi Institute, Budapest, Hungary Laszlo Lovasz Microsoft, USA Oliver Riordan Trinity College, UK Miklos Simonovits Renyi Institute, Budapest, Hungary Endre Szemeredi Rutgers, USA

94. GRAPH THEORY Math Archives Homepage. graph theory. David Lovelock, Andy Halper and ChandiHunt Department of Mathematics University of Arizona Tucson, Arizona 85721. http://archives.math.utk.edu/software/msdos/discrete.math/graph/.html

GRAPH THEORY David Lovelock, Andy Halper and Chandi Hunt Department of Mathematics University of Arizona Tucson, Arizona 85721 This self-extracting program will allow you to experiment with undirected, unweighted graphs. It can also decide whether a graph is planar, connected, has an Euler circuit, Euler path, or Hamilton cycle. The graph can have up to 26 vertices. Download graph.exe [211 KB]. Look at other programs in the University of Arizona collection.

95. Maple Application Center Press Room. Careers. Contact Us. graph theory, A Maplet for Graph Drawing, TravelingSalesman Problem, Introduction to graph theory, Subgroup lattice plotting in 3D, http://www.mapleapps.com/List.asp?CategoryID=12&Category=Graph Theory

96. Finite And Infinite Combinatorics Topics include graph theory, extremal and random graphs, combinatorial optimization and number theory, discrepancy theory, infinite combinatorics, and set theory. Budapest, Hungary, January 510, 2001. http://www.renyi.hu/~finf/

Finite and Infinite Combinatorics Budapest Hungary, January 5 (Friday) - 10 (Wednesday), 2001 Dear Colleagues, The special occasion for this meeting is to honour the 70th birthdays of Professors and Download the list of the presented talks in DVI format or in PostScript format. Download the list of participants in DVI format or in PostScript format We would highly appreciate if you filled out and submitted the participant questionnaire of CORDIS here . Thank you. We thank all participants for coming to Budapest The Organizing Commitee G. O. H. Katona (Co-chair) G. Y. Katona (Secretary) Mail address: HUNGARY Phone:(36 1) 201 7656 Phone/Fax: (36 1) 201 6974 Email: finf@renyi.hu

97. Graph Theory And Applications Research - School Of Electrical Engineering And Co University Faculty School graph theory Research. graph theory APPLICATIONSRESEARCH GROUP (GTG). Projects Publications People Funding Useful Links Photos. http://www.cs.newcastle.edu.au/Research/GTG/

The University of Newcastle - Australia Home Search Quick Find ... Photos If you are interested in studying for a PhD or Masters please contact mirka@cs.newcastle.edu.au Authorised by: The Deans Unit Site maintained by A/Professor Mirka Miller Last Updated: 19 October 2001 Comments / About this Web Site

98. SIAM Journal On Discrete Mathematics The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory. http://www.siam.org/journals/sidma/sidma.htm

Search SIAM Journal on Discrete Mathematics Jerrold R. Griggs, Editor-in-Chief The SIAM Journal on Discrete Mathematics publishes research articles on a broad range of topics from pure and applied mathematics including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, and coding and communication theory. Click Here for the latest issues. Questions/Comments about our Web pages? Use our suggestion box or send e-mail to the Online Services Manager. About SIAM Membership Journals SIAM News ... Laura B. Helfrich , Online Services Manager Updated: DJC

99. Graph Theory Day 42 DIMACS Center, Rutgers University, Piscataway, NJ, USA; 10 November 2001. 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.

100. Graph Theory graph theory Links, graph theory Lecture Notes, graph theory Journals, bibilographyetc. graph theory Lecture Notes. Graphs and graph theory; Graph Coloring Page; http://www.personal.kent.edu/~rmuhamma/GraphTheory/graphTheory.htm

Algorithms Compilers Computer Architecture Computational Geometry ... Parallel Computing Graph Theory Lecture Notes Introduction Definitions and Examples Eulerian Graphs Hamiltonian Graphs ... Graph Coloring Related Links Advanced Topics in Graph Algorithms (ps) by Ron Shamir Technical report based on lecture notes. Collection of Lecture Notes, Surveys, and Papers at U. of Paderborn-Germany Geometry in Action: Graph Drawing by David Eppstein, U. California-Irvine Graphs and Graph Theory Graph Coloring Page Graph Drawing Tutorial (pdf) by Isabel F. Cruz and Roberto Tamassia Graph Theory (pdf) byReinhard Diestel Free searchable and hyperlinked electronic edition of the book. Graph: Theory - Algorithms - Complexity Graph Theory Tutorials and Graph Theory Glossary Graph Theory and its Applications comprehensive graph theory resource for graph theoreticians and students. Graph Theory White Pages, The Graph theory in Mathematical Atlas Online Information System Graph Class Inclusions Validation Proposal for Global Illumination and Rendering Techniques Study and reproduction of a complex environment using global illumination rendering techniques and BRDF sampled materials. Result accuracy is analyzed and commented. The complete project is available for further research. Software Libraries and Tools for Graph Drawing AGD LEDA-based library of C++ classes for graph drawing.

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

Page 5     81-100 of 165    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20