FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W745409370> ?p ?o ?g. }

• W745409370 abstract "This thesis focuses on two topics of graph algorithms.The first topic is network inference. How efficiently can we find an unknown graph using shortest path queries between its vertices? We assume that the graph has bounded degree. In the reconstruction problem, the goal is to find the graph; and in the verification problem, the goal is to check whether a given graph is correct. We provide randomized algorithms based on a Voronoi cell decomposition. Next, we analyze greedy algorithms, and show that they are near-optimal. We also study the problems on special graph classes, prove lower bounds, and study the approximate reconstruction.The second topic is optimization in planar graphs. We study two problems.In the correlation clustering problem, the input is a weighted graph, where every edge has a label of + or -, indicating whether its endpoints are in the same category or in different categories. The goal is to find a partition of the vertices into categories that tries to respect the labels. In the two-edge-connected augmentation problem, the input is a weighted graph and a subset R of edges. The goal is to produce a minimum-weight subset S of edges, such that for every edge in R, its endpoints are two-edge-connected in the union of R and S. For planar graphs, we reduce correlation clustering to two-edge-connected augmentation, and show that both problems, although they are NP-hard, have a polynomial-time approximation scheme. We build on the brick decomposition technique developed recently." @default.
• W745409370 created "2016-06-24" @default.
• W745409370 creator A5051938451 @default.
• W745409370 date "2015-07-06" @default.
• W745409370 modified "2023-09-23" @default.
• W745409370 title "Graph algorithms : network inference and planar graph optimization" @default.
• W745409370 cites W1482267486 @default.
• W745409370 cites W1532569127 @default.
• W745409370 cites W1590399153 @default.
• W745409370 cites W1592764834 @default.
• W745409370 cites W1607394607 @default.
• W745409370 cites W162435663 @default.
• W745409370 cites W171155747 @default.
• W745409370 cites W179577048 @default.
• W745409370 cites W1802051025 @default.
• W745409370 cites W1842158843 @default.
• W745409370 cites W1973911938 @default.
• W745409370 cites W1973912434 @default.
• W745409370 cites W1981264533 @default.
• W745409370 cites W1985875030 @default.
• W745409370 cites W1989224473 @default.
• W745409370 cites W1990411021 @default.
• W745409370 cites W1991531041 @default.
• W745409370 cites W1997881834 @default.
• W745409370 cites W2001139415 @default.
• W745409370 cites W2002452451 @default.
• W745409370 cites W2006383304 @default.
• W745409370 cites W2017274979 @default.
• W745409370 cites W2017732166 @default.
• W745409370 cites W2028332892 @default.
• W745409370 cites W2033105850 @default.
• W745409370 cites W2033112846 @default.
• W745409370 cites W2038686820 @default.
• W745409370 cites W203959742 @default.
• W745409370 cites W2040924621 @default.
• W745409370 cites W2045749371 @default.
• W745409370 cites W2050935509 @default.
• W745409370 cites W2051699458 @default.
• W745409370 cites W2052687843 @default.
• W745409370 cites W2056711111 @default.
• W745409370 cites W2057994027 @default.
• W745409370 cites W2060615452 @default.
• W745409370 cites W2065166038 @default.
• W745409370 cites W2077824753 @default.
• W745409370 cites W2079970266 @default.
• W745409370 cites W2091569826 @default.
• W745409370 cites W2091858563 @default.
• W745409370 cites W2092113566 @default.
• W745409370 cites W2096320713 @default.
• W745409370 cites W2098865491 @default.
• W745409370 cites W2102338614 @default.
• W745409370 cites W2113239207 @default.
• W745409370 cites W2119823327 @default.
• W745409370 cites W2125378844 @default.
• W745409370 cites W2131926707 @default.
• W745409370 cites W2133065816 @default.
• W745409370 cites W2140668275 @default.
• W745409370 cites W2146081992 @default.
• W745409370 cites W2150742617 @default.
• W745409370 cites W2154604089 @default.
• W745409370 cites W2154785834 @default.
• W745409370 cites W2165094933 @default.
• W745409370 cites W2172955861 @default.
• W745409370 cites W2295256067 @default.
• W745409370 cites W2570206580 @default.
• W745409370 cites W2570240585 @default.
• W745409370 cites W2611831635 @default.
• W745409370 cites W2774158340 @default.
• W745409370 cites W2914959486 @default.
• W745409370 cites W3036999547 @default.
• W745409370 cites W323055482 @default.
• W745409370 cites W625072069 @default.
• W745409370 cites W855674090 @default.
• W745409370 cites W2583991744 @default.
• W745409370 cites W2610631890 @default.
• W745409370 hasPublicationYear "2015" @default.
• W745409370 type Work @default.
• W745409370 sameAs 745409370 @default.
• W745409370 citedByCount "0" @default.
• W745409370 crossrefType "dissertation" @default.
• W745409370 hasAuthorship W745409370A5051938451 @default.
• W745409370 hasConcept C101837359 @default.
• W745409370 hasConcept C11413529 @default.
• W745409370 hasConcept C114614502 @default.
• W745409370 hasConcept C118615104 @default.
• W745409370 hasConcept C132525143 @default.
• W745409370 hasConcept C17169500 @default.
• W745409370 hasConcept C18819970 @default.
• W745409370 hasConcept C19332903 @default.
• W745409370 hasConcept C203776342 @default.
• W745409370 hasConcept C22149727 @default.
• W745409370 hasConcept C33923547 @default.
• W745409370 hasConcept C41008148 @default.
• W745409370 hasConcept C48903430 @default.
• W745409370 hasConcept C80444323 @default.
• W745409370 hasConceptScore W745409370C101837359 @default.
• W745409370 hasConceptScore W745409370C11413529 @default.
• W745409370 hasConceptScore W745409370C114614502 @default.
• W745409370 hasConceptScore W745409370C118615104 @default.
• W745409370 hasConceptScore W745409370C132525143 @default.

• next