Zhao Liang 趙亮

… Alternative Names

ZHAO LIANG 趙亮

ZHAO Liang 趙亮

Less

Researcher Number	90344902
Other IDs
Affiliation (Current)	2025: 京都大学, 総合生存学館, 教授
Affiliation (based on the past Project Information) *help	2018 – 2023: 京都大学, 総合生存学館, 准教授 2014 – 2016: 京都大学, 総合生存学館, 准教授 2012 – 2013: 京都大学, 大学院・情報学研究科, 講師 2006 – 2013: 京都大学, 情報学研究科, 講師 2010: Kyoto University, 大学院・情報学研究科, 講師
Review Section/Research Field	Principal Investigator Basic Section 60020:Mathematical informatics-related / Fundamental theory of informatics / Mathematical informatics Except Principal Investigator Theory of informatics / Fundamental theory of informatics / Science and Engineering
Keywords	Principal Investigator アルゴリズム / 議席配分 / 一票の格差 / 支配集合 / set cover / 組み合わせ最適化 / ネットワークの構造的複雑度 / ネットワークモデル / 代表問題 / グラフ学習 … More / ネットワークのピラミッド構造 / ネットワークの支配問題 / network control / allometry / complex network / distance dominating set / 民主度指標 / ネットワークの代表点 / 都合の良い議員定数 / ネットワークアルゴリズム / 最適な議員定数 / ネットワークの代表問題 / ピラミッド構造 / グラフ・ネットワーク / アロメトリー / 代表集合 / 複雑ネットワーク / distance covering / distacne dominating / Dominating set / outerplanar graph / democratic number / network algorithm / distance dominating / 集合被覆 / Node Early-Fixing / 時間依存最短路問題 / 大規模最短路計算 / A*アルゴリズム / ALTアルゴリズム / source routing / algorithm / active beacon / network monitoring / L-ビーコン / 組合せ最適化 / グラフのカバー問題 / インターネット観測 / ビーコン配置問題 / 支配集合問題 / 頂点被覆 … More Except Principal Investigator 離散最適化 / アルゴリズム / グラフ理論 / スケジューリング / グラフ描画 / 最適化 / ネットワーク構造 / 計算量 / 数理計画 / 高速コンピューティング / 情報工学 / 列挙法 / 近似解法 / 計算量解析 / 厳密解法 / 計算機科学 / 数理工学 / 機械スケジューリング / グラフ分割 / 最小カット / ミニマックス問題 / 分枝限定法 / グラフのランキング / パッキング問題 / 部分木被覆 / 最長路問題 / ファイアウォール高速化 / 図形パッキング / グラフ連結度 / パッキング / 近似アルゴリズム / 配送スケジューリング / ネットワーク設計 / 連結度 / グラフアルゴリズム Less

ネットワーク支配問題の新展開Principal Investigator
- Principal Investigator
  
  趙亮
- Project Period (FY)
  2023 – 2025
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60020:Mathematical informatics-related
- Research Institution
  Kyoto University
Advanced algorithm and its applications for the domination problem in complex networksPrincipal Investigator
- Principal Investigator
  
  ZHAO LIANG
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60020:Mathematical informatics-related
- Research Institution
  Kyoto University
Design Theory and Implementation of Fast Algorithms to Graph Optimization
- Principal Investigator
  
  Hiroshi Nagamochi
- Project Period (FY)
  2014 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto University
Approximation algorithms for set cover problems with graph structuresPrincipal Investigator
- Principal Investigator
  
  ZHAO LIANG
- Project Period (FY)
  2013 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Mathematical informatics
- Research Institution
  Kyoto University
Algorithm design techniques based on transformation into network structure
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2011 – 2013
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
Fast algorithm for large-scale time-dependent shortest path problemPrincipal Investigator
- Principal Investigator
  
  ZHAO Liang
- Project Period (FY)
  2011 – 2012
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
A study on formulation and efficient algorithms for an optimization problem in the Internet monitoringPrincipal Investigator
- Principal Investigator
  
  ZHAO Liang
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University
Design of Approximation Algorithms for the Problems with Grapth Structure
- Principal Investigator
  
  NAGAMOCHI Hiroshi
- Project Period (FY)
  2004 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas
- Review Section
  
  Science and Engineering
- Research Institution
  Kyoto University

[Book] 選挙・投票・公共選択の数理（担当：第6章）2022
- Author(s)
  趙亮、谷本明子、呂文若（編集：日本応用数理学会、大山達雄）
- Total Pages
  352
- Publisher
  共立出版
- ISBN
  9784320019560
- Data Source
  KAKENHI-PROJECT-18K11182
[Book] "Finding Small Dominating Sets in Large-Scale Networks," in Big Data of Complex Networks2016
- Author(s)
  Liang Zhao
- Publisher
  Chapman and Hall/CRC
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] Pyramid as a Core Structure in Social Networks2024
- Author(s)
  Lyu, Wenruo; Zhao, Liang
- Journal Title
  
  Studies in Computational Intelligence (as Complex Networks & Their Applications XII. COMPLEX NETWORKS 2023)
  
  Volume: 1142 Pages: 82-94
- DOI
  10.1007/978-3-031-53499-7_7
- ISBN
  9783031534980, 9783031534997
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23K10997
[Journal Article] A Spatial Connection Aware Complex Network Model for Real-World Social Networks2024
- Author(s)
  Lyu, Wenruo; Zhao, Liang
- Journal Title
  
  Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City
  
  Volume: ICIT '23 Pages: 155-160
- DOI
  10.1145/3638985.3639011
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23K10997
[Journal Article] A Study on a Pyramid Structure in Social Networks2022
- Author(s)
  Wenruo Lyu, Liang Zhao
- Journal Title
  
  日本オペレーションズ・リサーチ学会2022春季発表会予稿集
  
  Volume: 1-B Pages: 8-8
- Data Source
  KAKENHI-PROJECT-18K11182
[Journal Article] Correction to: An Allometric Scaling for the Number of Representative Nodes in Social Networks2020
- Author(s)
  Zhao Liang, Peng Tianyi
- Journal Title
  
  Proceedings of NetSci-X 2020, Springer Proceedings in Complexity
  
  Volume: 1 Pages: 49-59
- DOI
  10.1007/978-3-030-38965-9_19
- ISBN
  9783030389642, 9783030389659
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11182
[Journal Article] Optimal assignment of wide-area evacuation centers for Kyoto city2017
- Author(s)
  Liang Zhao, Tetsuya Hashitani, Yukako Takeshita, Riku Hayami, Yukiko Ninomiya, Kengo Umegagi, Daichi Azuma, Ryota Miyamoto, Tomomi Itani
- Journal Title
  
  Proc. 5th Operations Research and Statistics
  
  Volume: 1 Pages: 171-174
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] $\gamma_k(n) = \max \{\lfloor n/(2k+1) \rfloor, 1\}$ for maximal outerplanar graphs with $n \bmod (2k+1) \le 6$2017
- Author(s)
  Liang Zhao
- Journal Title
  
  Journal of Information Processing
  
  Volume: 印刷中
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] Majority Dominating and Democratic Number: A Proposal to Define the Democracy of a Social Network2016
- Author(s)
  Liang Zhao
- Journal Title
  
  Proc. 4th Annual International Conference on Operations Research and Statistics
  
  Volume: 1 Pages: 66-67
- DOI
  10.5176/2251-1938_ors16.19
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] $gamma_k(G) le lfloor frac{n}{2k+1} rfloor$ for maximal outerplanar graphs satisfying $n bmod (2k+1) le 4$2014
- Author(s)
  Liang Zhao, Jia Li and Dorothea Wagner
- Journal Title
  
  Proc. of the 17th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2014)
  
  Volume: 1
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] A note on distance dominating in maximal outerplanar graphs2014
- Author(s)
  Liang Zhao, Jia Li, Dorothea Wagner
- Journal Title
  
  情報処理学会　研究報告アルゴリズム（AL）
  
  Volume: 2014-AL-147 Pages: 1-3
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] An Improved Linear-Time Algorithm for Finding Small L-VertexCovers2013
- Author(s)
  Liang Zhao, Hiroshi Kadowaki
- Journal Title
  
  Proc. 16th Korea-Japan Joint Workshop on Algorithms and Computation
  
  Volume: 1 Pages: 38-42
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] Node Early-Fixing: A Practical Speedup Technique for A* Algorithms2013
- Author(s)
  Liang Zhao, Mingji Gao
- Journal Title
  
  GSTF Intl. J. Mathematics, Statistics and Operations Research (JMSOR)
  
  Volume: vol. 2, no. 1
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700018
[Journal Article] A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs2013
- Author(s)
  Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 8266 Pages: 157-164
- DOI
  10.1007/978-3-319-03889-6_18
- ISBN
  9783319038889, 9783319038896
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-25330026
[Journal Article] Approximation algorithms for the L-distance vertex cover problem2012
- Author(s)
  Qiaoyun Chen, Liang Zhao
- Journal Title
  
  Proc. Third International Conference on Theoretical and Mathematical Foundations of Computer Science (ICTMF 2012), Bali, Indonesia
  
  Volume: 1 Pages: 100-104
- NAID
  110009455733
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700018
[Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005
- Author(s)
  L.Zhao, H.Nagamochi, T.Ibaraki
- Journal Title
  
  Mathematical Programming 102・1
  
  Pages: 167-183
- Data Source
  KAKENHI-PROJECT-16092212
[Journal Article] A greedy splitting algorithm for approximating multiway partition problems2005
- Author(s)
  L.Zhao
- Journal Title
  
  Mathematical Programming 102・1
  
  Pages: 167-183
- Data Source
  KAKENHI-PROJECT-16092212
[Journal Article] On generalized greedy splitting algorithms for multiway partition problems2004
- Author(s)
  L.Zhao, H.Nagamochi, T.Ibaraki
- Journal Title
  
  Discrete Applied Mathematics 143・1
  
  Pages: 130-143
- Data Source
  KAKENHI-PROJECT-16092212
[Journal Article] Node Early-Fixing: A Practical Speedup Technique for A* Algorithms
- Author(s)
  Liang Zhao, Mingji Gao
- Journal Title
  
  GSTF Journal of Mathematics, Statistics and Operations Research
  
  Volume: Vol. 2 (to appear)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] 非線形代表理論2024
- Author(s)
  趙亮、谷本明子、呂文若
- Organizer
  日本応用数理学会第20回研究部会連合発表会
- Data Source
  KAKENHI-PROJECT-23K10997
[Presentation] On a Pyramid Structure in Social Networks and its Application2023
- Author(s)
  Wenruo Lyu, Liang Zhao
- Organizer
  日本オペレーションズ・リサーチ学会2023年春季研究発表会
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] 比例型社会指標のスケール不揃い問題2023
- Author(s)
  趙亮
- Organizer
  日本オペレーションズ・リサーチ学会2023年春季研究発表会
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] Malapportionment and Evaluating the Inequality for Degressive Proportionment with Representativeness Index2021
- Author(s)
  Akiko Tanimoto, Wenruo, Lyu, Liang Zhao
- Organizer
  The 22nd Conference of the International Federation of Operational Research Societies
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] 選挙区格差の再考―代表度指標の提案―2020
- Author(s)
  谷本明子、呂文若、趙亮
- Organizer
  日本オペレーションズ・リサーチ学会２０２０年春季研究発表会
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] A Social Network Based Model for the Size of the Parliament2020
- Author(s)
  Lyu, Wenruo and Liang Zhao
- Organizer
  日本オペレーションズ・リサーチ学会２０２０年春季研究発表会
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] 適切な議員定数と一票の格差2018
- Author(s)
  趙亮、呂文若
- Organizer
  日本応用数理学会数理政治学研究会（静岡大学）
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] 社会的ネットワークの観点から適切な国会議員定数を考える2018
- Author(s)
  呂文若、趙亮
- Organizer
  日本OR学会2018年秋季研究発表会
- Data Source
  KAKENHI-PROJECT-18K11182
[Presentation] A Note on Distance Domination in Maximal Outerplanar Graphs (Extended Abstract)2016
- Author(s)
  Liang Zhao
- Organizer
  19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
- Place of Presentation
  Tokyo Univ. of Science, Tokyo, Japan
- Year and Date
  2016-09-02
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25330026
[Presentation] 民主度指数を用いた代表選と一票格差への考察2016
- Author(s)
  趙　亮
- Organizer
  情報処理学会第13回ネットワーク生態学シンポジウム
- Place of Presentation
  千葉木更津オークラアカデミアパークホテル
- Year and Date
  2016-08-22
- Data Source
  KAKENHI-PROJECT-25330026
[Presentation] ネットワークで見る独裁と民主の差2015
- Author(s)
  趙　亮
- Organizer
  京都大学アカデミックデイ2015
- Place of Presentation
  京都大学
- Year and Date
  2015-10-04
- Data Source
  KAKENHI-PROJECT-25330026
[Presentation] Approximation algorithms for the L-distance vertex cover problem2012
- Author(s)
  Qiaoyun Chen, Liang Zhao
- Organizer
  Proc. the third International Conference onTheoretical and MathematicalFoundations of Computer Science (ICTMF 2012)
- Place of Presentation
  Bali, Indonesia
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] Node Early-Fixing: A Practical Speedup Technique for A* Algorithms2012
- Author(s)
  Liang Zhao, Mingji Gao
- Organizer
  the second International Conference on Operations Research and Statistics (ORS 2012)
- Place of Presentation
  Bali, Indonesia
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] Approximation algorithms for the L-distance vertex cover problem2012
- Author(s)
  Qiaoyun Chen, Liang Zhao
- Organizer
  第141回情報処理学会アルゴリズム研究会
- Place of Presentation
  北海道大学
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] Node Early-Fixing: A Practical Speedup Technique for A* Algorithms2012
- Author(s)
  Liang Zhao, Mingji Gao
- Organizer
  2nd Annual International Conference on Operations Research and Statistics (ORS 2012)
- Place of Presentation
  Bali, Indonesia
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] Approximation algorithms for the L-distance vertex cover problem2012
- Author(s)
  Qiaoyun Chen, Liang Zhao
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  北海道大学
- Year and Date
  2012-10-04
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] Some practical speed-up techniques for A* algorithms2011
- Author(s)
  Mingji Gao, Liang Zhao
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  山口大学
- Year and Date
  2011-11-18
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] A practical speed-up technique for A* algorithms (Abstract)2011
- Author(s)
  Liang Zhao, Pipaporn Enumthurapojn, Hiroshi Nagamochi
- Organizer
  4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2011)
- Place of Presentation
  HsinChu, Taiwan.
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] A practical speed-up technique for A^* algorithms (Abstract)2011
- Author(s)
  L.Zhao, P.Enumthurapojn, H.Nagamochi
- Organizer
  The 4^<th> Annual Meeting of Asian Association for Algorithms and Computation
- Place of Presentation
  HsinChu, Taiwan
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] A practical speed-up technique for A* algorithms2011
- Author(s)
  L. Zhao, P. Eumthurapojn, H. Nagamoch
- Organizer
  the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011)
- Place of Presentation
  Hsinchu, Taiwan
- Data Source
  KAKENHI-PROJECT-23500015
[Presentation] Some practical speed-up techniques for A* algorithms2011
- Author(s)
  Mingji Gao, Liang Zhao
- Organizer
  情報処理学会アルゴリズム研究会報告，2011-AL-137(7), pp. 1--2
- Place of Presentation
  山口大学
- Data Source
  KAKENHI-PROJECT-23700018
[Presentation] An A^* algorithm framework for the point-to-point time-dependent shortest path problem2010
- Author(s)
  T.Ohshima, P.Eumthurapojn, L.Zhao, H.Nagamochi
- Organizer
  The China-Japan Joint Conference on Computational Geometry, Graphs and Applications
- Place of Presentation
  Dalian, China
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] An A* algorithm framework for the point-to-point time-dependent shortest path problem, China-Japan Joint Conference on Computational Geometry2010
- Author(s)
  Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
- Organizer
  Graphs and Applications
- Place of Presentation
  Dalian, China.
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009
- Author(s)
  Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
- Organizer
  Intl.Conf.Computational Intelligence and Software Engineering (CiSE) 2009
- Place of Presentation
  Wuhan, China.
- Year and Date
  2009-12-13
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009
- Author(s)
  J.Wang, J.Gim, M.Sasaki, L.Zhao, H.Nagamochi
- Organizer
  Korea-Japan Joint Workshop WAAC2009
- Place of Presentation
  Seoul, Korea
- Year and Date
  2009-07-04
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] On An Edge-Dominating Problem in Networks2009
- Author(s)
  Liang Zhao, Jaeseong Gim, Hiroshi Nagamochi
- Organizer
  情報処理学会第6回ネットワーク生態学シンポジウム
- Place of Presentation
  つくば産業技術研究所
- Year and Date
  2009-12-18
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009
- Author(s)
  Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
- Organizer
  Korea-Japan Joint Workshop WAAC 2009
- Place of Presentation
  Seoul, Korea.
- Year and Date
  2009-07-04
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] An efficient algorithm for large-scale beacon placement problem2009
- Author(s)
  Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
- Organizer
  電子情報通信学会2009年総合大会COMP学生シンポジウム
- Place of Presentation
  愛媛大学
- Year and Date
  2009-03-19
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] On An Edge-Dominating Problem in Networks2009
- Author(s)
  Liang Zhao, Jaeseong Gim, Hiroshi Nagamochi
- Organizer
  情報処理学会・第6回ネットワーク生態学シンポジウム
- Place of Presentation
  つくば産業技術研究所
- Year and Date
  2009-12-18
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009
- Author(s)
  J.Wang, J.Gim, M.Sasaki, L.Zhao, H.Nagamochi
- Organizer
  Intl.Conf.Computational Intelligence and Software Engineering (CiSE) 2009
- Place of Presentation
  中国・武漢大学
- Year and Date
  2009-12-13
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Security-aware beacon based network monitoring2008
- Author(s)
  Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
- Organizer
  11th IEEE International Conference on Communication Systems 2008
- Place of Presentation
  中国広州アジア国際ホテル
- Year and Date
  2008-11-19
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] Security-aware beacon based network monitoring2008
- Author(s)
  Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
- Organizer
  11th IEEE Intl.Conference on Communication Systems 2008
- Place of Presentation
  Guangzhou, China.
- Year and Date
  2008-11-19
- Data Source
  KAKENHI-PROJECT-20700010
[Presentation] On the time-dependent shortest path problem2007
- Author(s)
  趙亮
- Organizer
  Chinese Academy of Science-Kyoto University Joint Workshop
- Place of Presentation
  中国科学院・数学システム科学研究院(北京)
- Year and Date
  2007-03-17
- Data Source
  KAKENHI-PROJECT-16092212

1. NAGAMOCHI Hiroshi (70202231)

# of Collaborated Projects: 3 results

# of Collaborated Products: 2 results
2. KARUNO Yoshiyuki (80252542)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
3. UNO Yushi (60244670)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
4. YAMAZAKI Koichi (00246662)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. FUKUNAGA Takuro (60452314)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

Zhao Liang 趙 亮

ZHAO LIANG 趙 亮

ZHAO Liang 趙 亮

Research Projects

Research Products

Co-Researchers

ネットワーク支配問題の新展開Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Advanced algorithm and its applications for the domination problem in complex networksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Design Theory and Implementation of Fast Algorithms to Graph Optimization

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Approximation algorithms for set cover problems with graph structuresPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Algorithm design techniques based on transformation into network structure

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Fast algorithm for large-scale time-dependent shortest path problemPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A study on formulation and efficient algorithms for an optimization problem in the Internet monitoringPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Design of Approximation Algorithms for the Problems with Grapth Structure

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

[Book] 選挙・投票・公共選択の数理（担当：第6章）2022

Author(s)

Total Pages

Publisher

ISBN

Data Source

[Book] "Finding Small Dominating Sets in Large-Scale Networks," in Big Data of Complex Networks2016

Author(s)

Publisher

Data Source

[Journal Article] Pyramid as a Core Structure in Social Networks2024

Author(s)

Journal Title

DOI

ISBN

Data Source

[Journal Article] A Spatial Connection Aware Complex Network Model for Real-World Social Networks2024

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A Study on a Pyramid Structure in Social Networks2022

Author(s)

Journal Title

Data Source

[Journal Article] Correction to: An Allometric Scaling for the Number of Representative Nodes in Social Networks2020

Zhao Liang 趙亮

ZHAO LIANG 趙亮

ZHAO Liang 趙亮