FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p Approximating the maximally balanced connected partition problem in graphs ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W2002805364
title
"
Approximating the maximally balanced connected partition problem in graphs
"
@default
.