Weighted Matching in the Semi-Streaming Model

A subset $M\subseteq E$ of edges of a graph $G=(V,E)$ is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G[M], the subgraph of G induced by M, is the same as G[S], the subgraph of G induced ...$$$$$$

For a fixed integer $$b>1$$b>1, a set $$D\subseteq V$$D⊆V is called a b-disjunctive dominating set of the graph $$G=(V,E)$$G=(V,E) if for every vertex $$v\in V{\setminus }D$$v?V\D, v is either adjacent to a vertex of D or has at least b vertices in D at ...

Let $$G=V,E$$ be a connected graph with at least two vertices. For a fixed positive integer $$b>1$$, a set $$D\subseteq V$$ is called a b-disjunctive total dominating set of G if for every vertex $$v\in V$$, v is either adjacent to a vertex of D or has ...