General Information
| Student: | Tomáš Masařík |
|---|---|
| Office: | 444 |
| School: | Charles University in Prague |
| E-mail: | masarik (or tmasarik) guess_what_is_here kam.mff.cuni.cz (reu.dimacs.rutgers.edu) |
| Website: | kam.mff.cuni.cz/~tarken |
| Project: | Complexity of Fair Deletion Problems |
Complexity of Fair Deletion Problems
Project Description
Many important algorithmic problems in graph theory can be stated as deletion problems – i.e. find a set such that graph satisfies certain property after deletion of such a set. Typically we look for a smallest such set but sometimes we want the set to be fair in some sense. For example: find a set of edges after deletion of whitch a graph is acyclic while minimizing the maximal number of deleted edges incident with a vertex.Coworkers
Presentations
- First Presentation (Introduction)
Additional Information
My Mentorhttp://www.mgvis.com/
http://www.mgvis.com/AbelloVitaResearchOct08.html