AdvOL Student Seminars and Defences
Joe Guan, January 23, 2018, 15:30-16:00, ITB 201
Speaker:   Joe Guan

Title:  Geometric Aspects of Combinatorial Optimization
 
AdvOL Optimization Seminars
Antoine Deza, January 23, 2018, 16:30-17:30, ITB 201
Speaker:   Antoine Deza
Department of Computing and Software
McMaster University

Title:  On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs
Read more...
 
Fields Institute Industrial Optimization Seminar, January 16, 2018
Speakers:   Paul Ayers (McMaster University)
Jeffrey Kelly (Industrial Algorithms)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Yannis Manoussakis, May 28, 2013, 16:30-17:30, ITB 201
Friday, 23 February 2018
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Brazil
 < 1.0 % Educational
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5342618
Yannis Manoussakis, May 28, 2013, 16:30-17:30, ITB 201
Speaker:   Yannis Manoussakis
Department of Computer Science
University Paris-Sud, Orsay, France

Title:  Edge Colored Graphs: Structural Results, Algorithms and Applications

Recent years have seen significant interests in problems of colored graphs due to their theoretical appeal and applicability in various fields. In particular, problems arising in molecular biology are often formulated using colored graphs, i.e. graphs with colored edges and/or vertices. Given such a graph, original problems correspond to extracting sub-graphs such as Hamiltonian and Eulerian paths or cycles colored in a specified pattern. The most natural pattern in such a context is the so-called proper coloring, i.e. adjacent edges/vertices having different colors. Properly colored paths and cycles have applications in various other fields such as VLSI for compacting a programmable logical array. Other applications include social sciences where a color represents a relation between two individuals and the notion of properly edge colored paths and cycles is related to the balance of a graph. Although a large body of work has already been done, in much of the research, the number of colors is restricted to two. For instance, while how to find efficiently a properly edge colored Hamiltonian cycle in a 2-edge colored complete graph is well known, it is a long standing open question how to find such cycles in complete graphs whose edges are colored by any number of colours. During this talk, the most important results in the area related to various forms of proper subgraphs (trees, paths, cycles etc) in complete or general graphs for any number of used colors will be discussed.
 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!