- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.063 seconds)Spelling suggestions: "subject:"densest subgraph"" "subject:"tensest subgraph""
| 1 |
Approximate Partially Dynamic Directed Densest SubgraphRichard Zou Li (15361858) 29 April 2023 (has links)
<p>The densest subgraph problem is an important problem with both theoretical and practical significance. We consider a variant of the problem, the directed densest subgraph problem, under the partially dynamic setting of edge insertions only. We give a algorithm maintaining a (1-ε)-approximate directed densest subgraph in O(log<sup>3</sup>n/ε<sup>6</sup>) amortized time per edge insertion, based on earlier work by Chekuri and Quanrud. This result partially improves on an earlier result by Sawlani and Wang, which guarantees O(log<sup>5</sup>n/ε<sup>7</sup>) worst case time for edge insertions and deletions.</p>
|
| 2 |
Analysis of Biological Networks by Graph Theory-based Methods / 生物情報ネットワークのグラフ理論に基づく解析法Li, Ruiming 23 March 2023 (has links)
京都大学 / 新制・課程博士 / 博士(情報学) / 甲第24730号 / 情博第818号 / 新制||情||138(附属図書館) / 京都大学大学院情報学研究科知能情報学専攻 / (主査)教授 阿久津 達也, 教授 山本 章博, 教授 岡部 寿男 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM
|
| 3 |
Efficient and Effective Local Algorithms for Analyzing Massive GraphsWu, Yubao 31 May 2016 (has links)
No description available.
|
Page generated in 0.0679 seconds