咨询与建议

限定检索结果

文献类型

  • 6 篇 会议
  • 3 篇 期刊文献

馆藏范围

  • 9 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 7 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 软件工程
  • 5 篇 理学
    • 5 篇 数学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 9 篇 graph and networ...
  • 2 篇 approximation al...
  • 2 篇 computational co...
  • 1 篇 scalability
  • 1 篇 parallel perform...
  • 1 篇 resource managem...
  • 1 篇 stochastic combi...
  • 1 篇 mcnaughton games
  • 1 篇 cut basis proble...
  • 1 篇 algorithms
  • 1 篇 scalable storage
  • 1 篇 improved models
  • 1 篇 infinite graph g...
  • 1 篇 connectivity
  • 1 篇 directed matchin...
  • 1 篇 optimal vaccinat...
  • 1 篇 data analytics a...
  • 1 篇 cloud workflow
  • 1 篇 metadata
  • 1 篇 graph theory

机构

  • 2 篇 rhein westfal th...
  • 1 篇 univ salerno dip...
  • 1 篇 microsoft corp r...
  • 1 篇 north carolina s...
  • 1 篇 robert bosch llc...
  • 1 篇 politecn milan d...
  • 1 篇 carnegie mellon ...
  • 1 篇 tech univ kaiser...
  • 1 篇 peking univ dept...
  • 1 篇 univ utrecht ins...
  • 1 篇 peng cheng lab p...
  • 1 篇 univ texas dalla...
  • 1 篇 univ auckland de...
  • 1 篇 carnegie mellon ...

作者

  • 2 篇 segschneider jen...
  • 2 篇 koster arie m. c...
  • 1 篇 bhattacharyya ab...
  • 1 篇 bunke florentine
  • 1 篇 hamacher horst w...
  • 1 篇 yu huashan
  • 1 篇 schwahn anne m.
  • 1 篇 gubbala prabhaka...
  • 1 篇 kim hyeongsik
  • 1 篇 anthony barbara ...
  • 1 篇 wang xiaolin
  • 1 篇 gargano l
  • 1 篇 anyanwu kemafor
  • 1 篇 hammar m
  • 1 篇 luo yingwei
  • 1 篇 khoussainov b
  • 1 篇 bodlaender hl
  • 1 篇 raghavachari bal...
  • 1 篇 maffioli frances...
  • 1 篇 gupta anupam

语言

  • 7 篇 英文
  • 2 篇 其他
检索条件"主题词=Graph and network algorithms"
9 条 记 录,以下是1-10 订阅
排序:
Robust two-dose vaccination schemes and the directed b-matching problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 356卷 369-392页
作者: Segschneider, Jenny Koster, Arie M. C. A. Rhein Westfal TH Aachen Res Area Discrete Optimizat Aachen Germany
In light of the recent pandemic and the shortage of vaccinations during their rollout, questions arose regarding the best strategy to achieve immunity throughout the population by adjusting the time gap between the tw... 详细信息
来源: 评论
Optimal Vaccination Strategies for Multiple Dose Vaccinations  7th
Optimal Vaccination Strategies for Multiple Dose Vaccination...
收藏 引用
7th International Symposium on Combinatorial Optimization (ISCO)
作者: Segschneider, Jenny Koster, Arie M. C. A. Rhein Westfal TH Aachen Res Area Discrete Optimizat Aachen Germany
Due to the COVID-19 pandemic and the shortage of vaccinations during its roll-out, the question regarding the best strategy to achieve immunity in the population by adjusting the time between the two necessary vaccina... 详细信息
来源: 评论
An Edge-Fencing Strategy for Optimizing SSSP Computations on Large-Scale graphs  21
An Edge-Fencing Strategy for Optimizing SSSP Computations on...
收藏 引用
50th International Conference on Parallel Processing (ICPP)
作者: Yu, Huashan Wang, Xiaolin Luo, Yingwei Peking Univ Dept Comp Sci & Technol Beijing Peoples R China Peng Cheng Lab Shenzhen Peoples R China
The Single-Source Shortest Path (SSSP) problem is to compute the shortest distances in a weighted graph from a source vertex to every other vertex. This paper focuses on parallel efficiency and scalability of SSSP com... 详细信息
来源: 评论
Semantic Query Transformations for Increased Parallelization in Distributed Knowledge graph Query Processing  19
Semantic Query Transformations for Increased Parallelization...
收藏 引用
International Conference for High Performance Computing, networking, Storage and Analysis (SC)
作者: Kim, Hyeongsik Bhattacharyya, Abhisha Anyanwu, Kemafor Robert Bosch LLC Sunnyvale CA 94085 USA North Carolina State Univ Raleigh NC USA
Ontologies have become an increasingly popular semantic layer for integrating multiple heterogeneous datasets. However, significant challenges remain with supporting efficient and scalable processing of queries with d... 详细信息
来源: 评论
Minimum cut bases in undirected networks
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第4期158卷 277-290页
作者: Bunke, Florentine Hamacher, Horst W. Maffioli, Francesco Schwahn, Anne M. Tech Univ Kaiserlautern Dept Math D-67653 Kaiserslautern Germany Politecn Milan Dept Elect & Informat I-20133 Milan Italy
Given an undirected, connected network G = (V, E) with weights oil the edges, the cut basis problem is asking for a maximal number of linear independent cuts such that the sum of the cut weights is minimized. Surprisi... 详细信息
来源: 评论
Infrastructure leasing problems
收藏 引用
12th International Integer Programming and Combinatorial Optimization Conference
作者: Anthony, Barbara M. Gupta, Anupam Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA USA
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets D-t subset of V for each day t is an element of [T]. A feasible solution to the problem is a s... 详细信息
来源: 评论
A 4/3-approximation algorithm for minimum 3-edge-connectivity
收藏 引用
10th International Workshop on algorithms and Data Structures
作者: Gubbala, Prabhakar Raghavachari, Balaji Microsoft Corp Redmond WA 98052 USA Univ Texas Dallas Comp Sci Dept Richardson TX 75083 USA
The minimum cardinality 3-edge-connected spanning sub-graph problem is considered. An approximation algorithm with a performance ratio of 4/3 approximate to 1.33 is presented. This improves the previous best ratio of ... 详细信息
来源: 评论
There are spanning spiders in dense graphs (and we know how to find them)
There are spanning spiders in dense graphs (and we know how ...
收藏 引用
30th International Colloquium on Automata, Languages and Programming (ICALP 2003)
作者: Gargano, L Hammar, M Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi Italy
A spanning spider for a graph G is a spanning tree T of G with at most one vertex having degree three or more in T. In this paper we give density criteria for the existence of spanning spiders in graphs. We constructi... 详细信息
来源: 评论
Relaxed update and partition network games
收藏 引用
FUNDAMENTA INFORMATICAE 2002年 第4期49卷 301-312页
作者: Bodlaender, HL Dinneen, MJ Khoussainov, B Univ Utrecht Inst Comp & Informat Sci NL-3508 TB Utrecht Netherlands Univ Auckland Dept Comp Sci Auckland 1 New Zealand
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite... 详细信息
来源: 评论