QP-2021-01

Globally rigid components in two-dimensional generic frameworks

Tibor Jordán

We show that the maximal globally rigid subgraphs of a graph in $\R^2$ can be determined in polynomial time.

Bibtex entry:

@techreport{egresqp-21-01,

AUTHOR	=	{Jord{\'a}n, Tibor},
TITLE	=	{Globally rigid components in two-dimensional generic frameworks},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2021},
NUMBER	=	{QP-2021-01}

}