\thispagestyle{empty}
\pagenumbering{roman}

\begin{center}

% TITLE
{\Large 
A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
%Micro-Moving Target IPv6 Defense for 6LoWPAN and the Internet of Things
}

\vfill

Mudabir Kabir Asathulla 

\vfill

Thesis submitted to the Faculty of the \\
Virginia Polytechnic Institute and State University \\
in partial fulfillment of the requirements for the degree of

\vfill

MASTER OF SCIENCE\\
in \\
Computer Engineering

\vfill

Anil Kumar S Vullikanti, Chair \\
Sharath Raghvendra, Co-Chair\\
Haibo Zeng \\

\vfill

July 14, 2017 \\
Blacksburg, Virginia

\vfill

Keywords: Matching, maximum cardinality, bipartite, planar graph, planar separators 
\\
Copyright 2017, Mudabir Kabir Asathulla
\end{center}

\pagebreak
