activity
20122019
most citedUnitary cocycles and processes on the full Fock space

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2016

A heuristic approach for dividing graphs into bi-connected components with a size constraint

Raka Jovanovic, Tatsushi Nishi, Stefan Voss

In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions…