咨询与建议

限定检索结果

文献类型

  • 2,067 篇 期刊文献
  • 820 篇 会议
  • 32 篇 学位论文
  • 7 册 图书
  • 1 篇 资讯

馆藏范围

  • 2,926 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 2,319 篇 工学
    • 2,077 篇 计算机科学与技术...
    • 518 篇 软件工程
    • 349 篇 电气工程
    • 131 篇 测绘科学与技术
    • 130 篇 建筑学
    • 130 篇 土木工程
    • 129 篇 信息与通信工程
    • 77 篇 控制科学与工程
    • 34 篇 电子科学与技术(可...
    • 22 篇 网络空间安全
    • 20 篇 生物工程
    • 18 篇 材料科学与工程(可...
    • 13 篇 仪器科学与技术
    • 12 篇 交通运输工程
    • 11 篇 化学工程与技术
    • 11 篇 安全科学与工程
    • 10 篇 石油与天然气工程
  • 1,053 篇 理学
    • 944 篇 数学
    • 80 篇 统计学(可授理学、...
    • 62 篇 生物学
    • 51 篇 物理学
    • 27 篇 化学
    • 20 篇 系统科学
  • 190 篇 管理学
    • 140 篇 管理科学与工程(可...
    • 62 篇 图书情报与档案管...
    • 38 篇 工商管理
  • 36 篇 经济学
    • 35 篇 应用经济学
  • 33 篇 医学
    • 16 篇 临床医学
    • 11 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 9 篇 教育学
  • 8 篇 文学
  • 6 篇 农学
  • 1 篇 艺术学

主题

  • 2,927 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 94 篇 parallel algorit...
  • 65 篇 computational co...
  • 64 篇 graph theory
  • 56 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 49 篇 analysis of algo...
  • 45 篇 planar graphs
  • 44 篇 shortest paths
  • 44 篇 treewidth
  • 39 篇 social networks
  • 36 篇 data structures
  • 36 篇 distributed comp...
  • 33 篇 distributed algo...
  • 29 篇 parameterized al...
  • 29 篇 complexity
  • 29 篇 np-completeness
  • 26 篇 interval graphs

机构

  • 24 篇 univ bergen dept...
  • 19 篇 univ elect sci &...
  • 16 篇 ben gurion univ ...
  • 15 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 9 篇 univ vienna fac ...
  • 9 篇 technion israel ...
  • 9 篇 carnegie mellon ...
  • 9 篇 univ rostock ins...
  • 8 篇 indian inst tech...
  • 8 篇 simon fraser uni...
  • 8 篇 chinese univ hon...
  • 8 篇 swiss fed inst t...
  • 8 篇 carnegie mellon ...
  • 8 篇 natl inst inform...
  • 8 篇 tel aviv univ sc...
  • 8 篇 mit comp sci & a...

作者

  • 31 篇 xiao mingyu
  • 23 篇 tsur dekel
  • 18 篇 saurabh saket
  • 17 篇 panda b. s.
  • 16 篇 fomin fedor v.
  • 13 篇 bader david a.
  • 13 篇 bodlaender hans ...
  • 13 篇 pandey arti
  • 13 篇 lokshtanov danie...
  • 12 篇 kratsch dieter
  • 11 篇 karthick t.
  • 11 篇 de figueiredo ce...
  • 11 篇 henzinger monika
  • 11 篇 bodlaender hl
  • 11 篇 nanongkai danupo...
  • 10 篇 mcmillan scott
  • 10 篇 nagamochi hirosh...
  • 10 篇 low tze meng
  • 10 篇 dragan feodor f.
  • 9 篇 dondi riccardo

语言

  • 2,628 篇 英文
  • 287 篇 其他
  • 7 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2927 条 记 录,以下是301-310 订阅
排序:
Sparse graphic Degree Sequences Have Planar Realizations  49
Sparse Graphic Degree Sequences Have Planar Realizations
收藏 引用
49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024
作者: Bar-Noy, Amotz Böhnlein, Toni Peleg, David Ran, Yingli Rawitz, Dror NY United States Huawei Zurich Switzerland Weizmann Institute of Science Rehovot Israel Bar Ilan University Ramat-Gan Israel
A sequence d = (d1, d2, . . ., dn) of positive integers is graphic if it is the degree sequence of some simple graph G, and planaric if it is the degree sequence of some simple planar graph G. It is known that if ∑ d... 详细信息
来源: 评论
Parallel Katz Centrality On Evolving graphs  31
Parallel Katz Centrality On Evolving Graphs
收藏 引用
31st IEEE International Conference on High Performance Computing, Data, and Analytics Workshops, HiPCW 2024
作者: Sharma, Dishit Nijhara, Prajjwal Banerjee, Dip Sankar Department of Computer Science and Engineering Indian Institute of Technology Jodhpur India
Katz centrality measures a node’s influence within a network, considering the total number of walks between pairs of nodes rather than solely the shortest paths. This paper presents an algorithm for dynamically updat... 详细信息
来源: 评论
Eternal Connected Vertex Cover Problem in graphs: Complexity and algorithms  10th
Eternal Connected Vertex Cover Problem in Graphs: Complexity...
收藏 引用
10th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Paul, Kaustav Pandey, Arti Indian Inst Technol Ropar Dept Math Nangal Rd Rupnagar 140001 Punjab India
A variation of the vertex cover problem is the eternal vertex cover problem. This is a two-player (attacker and defender) game, where the defender must allocate guards at specific vertices in order for those vertices ... 详细信息
来源: 评论
The Modified Genetic Algorithm for Solving the Traveling Salesman Problem  28th
The Modified Genetic Algorithm for Solving the Traveling Sal...
收藏 引用
2024 International Conference Automation
作者: Solohubov, Illia Moroz, Artur Oliinyk, Andrii Subbotin, Sergey Skrupsky, Stepan Natl Univ Zaporizhzhya Politech Zaporizhzhya Ukraine
The Traveling Salesman Problem is one of the most relevant challenges today, as the need to solve it arises in various fields. However, there is no clear algorithm for its solution. It falls within the realm of NP-com... 详细信息
来源: 评论
Ant Colony Optimization Based Algorithm for Test Path Generation Problem with Negative Constraints  24
Ant Colony Optimization Based Algorithm for Test Path Genera...
收藏 引用
24th IEEE International Conference on Software Quality, Reliability and Security (QRS)
作者: Klima, Matej Bures, Miroslav Blaha, Martin Czech Tech Univ Fac Elect Engn Dept Comp Sci Syst Testing Intelligent Lab STILL Prague Czech Republic Univ Def Fac Mil Leadership Dept Fire Support Brno Czech Republic
Path-based testing is an established method for creating test cases comprising sequences of steps executed in a System Under Test (SUT). Several algorithms for generating the test sequences (paths) that satisfy variou... 详细信息
来源: 评论
Listing 6-Cycles in Sparse graphs  16
Listing 6-Cycles in Sparse Graphs
收藏 引用
16th Innovations in Theoretical Computer Science Conference, ITCS 2025
作者: Williams, Virginia Vassilevska Westover, Alek MIT CambridgeMA United States
This work considers the problem of output-sensitive listing of occurrences of 2k-cycles for fixed constant k ≥ 2 in an undirected host graph with m edges and t 2k-cycles. Recent work of Jin and Xu (and independently ... 详细信息
来源: 评论
Learning-Augmented Streaming algorithms for Approximating MAX-CUT  16
Learning-Augmented Streaming Algorithms for Approximating MA...
收藏 引用
16th Innovations in Theoretical Computer Science Conference, ITCS 2025
作者: Dong, Yinhao Peng, Pan Vakilian, Ali School of Computer Science and Technology University of Science and Technology of China Hefei China IL United States
We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a 1/2-approximation for estimating the value of MAX-CUT can be trivially achieve... 详细信息
来源: 评论
Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier  65
Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Bhattacharya, Sayan Carmon, Din Costa, Martin Solomon, Shay Zhang, Tianyi Univ Warwick Coventry W Midlands England Tel Aviv Univ Tel Aviv Israel
Vizing's theorem states that any n-vertex m-edge graph of maximum degree. can be edge colored using at most Delta + 1 different colors [Diskret. Analiz, '64]. Vizing's original proof is algorithmic and sho... 详细信息
来源: 评论
Partial Domination in Some Geometric Intersection graphs  11th
Partial Domination in Some Geometric Intersection Graphs
收藏 引用
11th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2025
作者: Dutta, Madhura Maheshwari, Anil Nandy, Subhas C. TCG CREST Kolkata700091 India School of Computer Science Carleton University Ottawa Canada Ramkrishna Mission Vivekananda Centenary College Kolkata700118 India Ghaziabad201002 India
Partial domination problem is a generalization of the minimum dominating set problem on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by ch... 详细信息
来源: 评论
A segment-graph algorithm for two-objective wireless spectrum allocation in cognitive networks
收藏 引用
COMPUTER COMMUNICATIONS 2021年 165卷 97-104页
作者: Gao, Jian Guo, Chubing Pu, Mingfeng Zhang, Xin Li, Ying Wu, Jianshe Yu, Xin Xidian Univ Sch Artificial Intelligence Xian 710071 Peoples R China Xidian Univ Joint Lab Artificial Intelligence China Elect Technol Grp Corp Res Inst 20 Xian 710068 Peoples R China Sci & Technol Elect Informat Control Lab Qingdao Peoples R China
A segment-graph algorithm is provided for wireless spectrum allocation in cognitive networks based on the cooperation of the secondary users, which aim to maximize the utilization of the limited spectrum bands and min... 详细信息
来源: 评论