A5102956208- Advanced Graph Theory Research
- Cooperative Communication and Network Coding
- Interconnection Networks and Systems
- Computational Geometry and Mesh Generation
- graph theory and CDMA systems
- Digital Image Processing Techniques
- Complexity and Algorithms in Graphs
- Information Systems Education and Curriculum Development
- Fuzzy and Soft Set Theory
- Neural Networks and Applications
- Advanced Antenna and Metasurface Technologies
- Teaching and Learning Programming
- Advanced Algebra and Logic
- Model Reduction and Neural Networks
- Experimental Learning in Engineering
- Adaptive Dynamic Programming Control
Harvey Mudd College
2024
Columbia University
2018-2021
City University of Seattle
2018
Williams College
2017-2018
Missouri University of Science and Technology
2001
Let $G=(V,E)$ be a graph and $t,r$ positive integers. The signal that vertex $v$ receives from tower of strength $t$ located at $T$ is defined as $sig(v,T)=max(t-dist(v,T),0)$, where $dist(v,T)$ denotes the distance between vertices $T$. In 2015 Blessing, Insko, Johnson, Mauretour $(t,r)$ broadcast dominating set, or simply broadcast, on $G$ set $\mathbb{T}\subseteq V$ such sum all received each $v \in least $r$. We say $\mathbb{T}$ optimal if $|\mathbb{T}|$ minimal among sets $\mathbb{T}$....
Let $G=(V,E)$ be a graph and $t,r$ positive integers. The \emph{signal} that tower vertex $T$ of signal strength $t$ supplies to $v$ is defined as $sig(T,v)=max(t-dist(T,v),0),$ where $dist(T,v)$ denotes the distance between vertices $T$. In 2015 Blessing, Insko, Johnson, Mauretour \emph{$(t,r)$ broadcast dominating set}, or simply broadcast}, on $G$ set $\mathbb{T}\subseteq V$ such sum all signals received at each $v \in from towers $\mathbb{T}$ least $r$. $(t,r)$ domination number finite...
The domination number of a finite graph $G$ with vertex set $V$ is the cardinality smallest $S\subseteq V$ such that for every $v\in either S$ or $v$ adjacent to in $S$. A $S$ satisfying these conditions called dominating set. In 2015 Blessing, Insko, Johnson, and Mauretour introduced $(t,r)$ broadcast domination, generalization parameterized by nonnegative integers $t$ $r$. this setting, we say signal receives from tower strength located at $T$ defined $sig(v,T)=max(t-dist(v,T),0)$. Then on...
We present a new model for hybrid planarity that relaxes existing representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such $G$ admits drawing where: (i) each cluster associated with closed, bounded planar region, called region; (ii) regions are pairwise disjoint, (iii) vertex $v \in V$ identified $p$ distinct points, \emph{ports}, on the boundary its (iv) inter-cluster edge $(u,v) E$ Jordan arc connecting port $u$ to $v$; (v)...