All-Nodes Median Parity

Given a graph G=(V,E)G = (V, E), compute Med(v)(mod  2)Med(v) (\mod 2) for all v∈Vv\in V, where Med(v):=∑w∈Vd(v,w)Med(v) := \sum\limits_{w\in V} d(v, w)

Parameters

  • nn: number of nodes
  • mm: number of edges

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions

Other relevant algorithms

Insuffient Data to display table