Speaker Marcus Schaefer DePaul University, Â鶹APP 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...
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...
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...
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...
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...
Event Topic Discrete Applied Math Seminar
Description Abstract: The most famous and useful characterization of k-connected graphs is Menger's Theorem, but there is another, very nice but little-known characterization of a wholly different...
