Hemanshu Kaul, Illinois Institute of Technology
Finding Large Subgraphs
4:00 pm –
4:50 pm
Avery Hall
Room: 115
1144 T St
Lincoln NE 68508
Lincoln NE 68508
Additional Info: AVH
Contact:
Sylvia Wiegand, (402) 472-7248, swiegand1@unl.edu
Abstract: The maximum subgraph problem for a fixed graph property P asks: Given a graph, find a subgraph satisfying property P that has the maximum number of edges. Similarly, we can talk about maximum induced subgraph problem. The property P can be planarity, acyclicity, bipartiteness, etc.
We will discuss some old and new problems of this flavor, focusing on the algorithmic aspects of these problems. In particular, we will describe some old results on the maximum bipartite subgraph problem and some new results on the maximum series-parallel subgraph problem.
This colloquium is funded in part by the UNL Research Council.
Local Host: Stephen Hartke
We will discuss some old and new problems of this flavor, focusing on the algorithmic aspects of these problems. In particular, we will describe some old results on the maximum bipartite subgraph problem and some new results on the maximum series-parallel subgraph problem.
This colloquium is funded in part by the UNL Research Council.
Local Host: Stephen Hartke
Additional Public Info:
The talk is preceded by refreshments at 3:30 p.m. in Avery Hall 348.