Research on Algorithms for Network Interdiction Problem
| Project/Area Number |
17F17727
|
|---|
| Research Category |
Grant-in-Aid for JSPS Fellows
|
| Allocation Type | Single-year Grants |
|---|
| Section | 外国 |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
| Host Researcher |
塩浦 昭義 東京工業大学, 工学院, 准教授 (10296882)
|
|---|
| Foreign Research Fellow |
BAFFIER JEAN-FRANCOIS 東京工業大学, 工学院, 外国人特別研究員
|
|---|
| Project Period (FY) |
2017-10-13 – 2020-03-31
|
| Project Status |
Completed (Fiscal Year 2019)
|
| Budget Amount *help |
¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2019: ¥300,000 (Direct Cost: ¥300,000)
Fiscal Year 2018: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2017: ¥400,000 (Direct Cost: ¥400,000)
|
|---|
| Keywords | network flow / large scale network / algorithms / network / flow / graph / algorithm |
|---|
| Outline of Annual Research Achievements |
In this year we have focused on the transmission of knowledge in information networks. A typical property of those networks is their massive scale, making classical algorithms difficult to apply. In previous research, we have introduced a model to evaluate the influence of the different actors (for instance, the articles in a citation network) in the transmission of this knowledge.
We encountered (and solved) several difficulties. The two major difficulties come from the temporal property of information networks. In our citation network example, we had considered that articles were static once submitted. However, it is not the case of pre-print articles that can be freely updated. First, cycles of influence exist, allowing self-gratification. Second, it also raises the question of the amount of knowledge produced by each version of an article.
We provided a method to decycle networks with small cycles. This method is also used to approximate the transmission of knowledge in networks with any cycle size. Such an extension is possible due to the nature of knowledge influence to fade at each interaction.
To handle the updates of articles (versioning) and dynamic citations, we needed a temporal model for interactions that can capture any arbitrary timeframe. We extended the definition of the classical flow and cut in graphs to stream graphs.
|
| Research Progress Status |
令和元年度が最終年度であるため、記入しない。
|
| Strategy for Future Research Activity |
令和元年度が最終年度であるため、記入しない。
|
Report
(3 results)
Research Products
(11 results)
-
-
-
-
-
-
-
-
[Journal Article] Gap-planar graphs2018
Author(s)
Bae Sang Won、Baffier Jean-Francois、Chun Jinhee、Eades Peter、Eickmeyer Kord、Grilli Luca、Hong Seok-Hee、Korman Matias、Montecchiani Fabrizio、Rutter Ignaz、T?th Csaba D.
-
Journal Title
Theoretical Computer Science
Volume: 745
Pages: 36-52
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
[Journal Article] Gap-Planar Graphs2017
Author(s)
Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Toth
-
Journal Title
Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization
Volume: LNCS10692
Pages: 531-545
DOI
ISBN
9783319739144, 9783319739151
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
