Feb
28
Random Mixed Hypergraphs and Upper Chromatic Number
Event Topic Discrete Applied Math Seminar
Events Archive
Find an Event
Currently selected filters
- Discrete Applied Math Seminar
Feb
21
Three balls on a cliff (part 1)
Event Topic Discrete Applied Math Seminar
Feb
7
More feedback vertex set problems
Event Topic Discrete Applied Math Seminar
Jan
31
An open problem in graph theory for students
Event Topic Discrete Applied Math Seminar
Nov
16
The Majority Decision Function for Trees (Part 2 of 2)
Description Abstract: Kenneth May in 1952 proved a classical theorem characterizing simple majority rule for two alternatives. Surprising recent work has employed this type of axiomatic approach for...
Nov
9
String Graphs and their complexity (Part 2 of 2)
Speaker Marcus Schaefer DePaul University, µç³µÎÞÂë http://ovid.cs.depaul.edu Description A string graph is the intersection graph of a set of Jordan curves in the plane. Each curve is represented by a...
Nov
2
The Majority Decision Function for Trees (Part 1 of 2)
Description Abstract: Kenneth May in 1952 proved a classical theorem characterizing simple majority rule for two alternatives. Surprising recent work has employed this type of axiomatic approach for...
Oct
5
Min-Energy Broadcast with Hitch-hiking
Description Abstract: Recently, there have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using Hitch-hiking. We study the...
Sep
28
Finding largebipartite subgraphs (Part 2 of 2)
Description Finding a bipartite subgraph with maximum number of edges in a given graph is a classical problem in combinatorial optimization and extremal graph theory. It has been studied in computer...
Sep
21
Finding large bipartite subgraphs (Part 1 of 2)
Description Finding a bipartite subgraph with maximum number of edges in a given graph is a classical problem in combinatorial optimization and extremal graph theory. It has been studied in computer...