{
  "http://dbpedia.org/resource/List_of_terms_relating_to_algorithms_and_data_structures" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Cut_vertex" } ] } ,
  "http://dbpedia.org/resource/Bridge_(graph_theory)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Cut_vertex" } ] } ,
  "http://dbpedia.org/resource/Vertex_(graph_theory)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Cut_vertex" } ] } ,
  "http://dbpedia.org/resource/Cut_vertex" : { "http://www.w3.org/2002/07/owl#sameAs" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Cut_vertex" } ] ,
    "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Biconnected_component" } ] ,
    "http://dbpedia.org/ontology/description" : [ { "type" : "literal", "value" : "graph vertex whose removal increases the number of connected components" , "lang" : "en" } ,
      { "type" : "literal", "value" : "\u0432\u0435\u0440\u0448\u0438\u043D\u0430 \u0433\u0440\u0430\u0444\u0430, \u0441\u0443\u0449\u0435\u0441\u0442\u0432\u0435\u043D\u043D\u0430\u044F \u0434\u043B\u044F \u0435\u0433\u043E \u0441\u0432\u044F\u0437\u043D\u043E\u0441\u0442\u0438" , "lang" : "ru" } ,
      { "type" : "literal", "value" : "Knoten eines Graphen, dessen Entfernen die Anzahl der zusammenh\u00E4ngenden Teilgraphen erh\u00F6hen w\u00FCrde" , "lang" : "de" } ,
      { "type" : "literal", "value" : "vertico en grafo, kies forigo pliigas la nombron de konektitaj komponantoj" , "lang" : "eo" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Biconnected_component" } ] }
}
