咨询与建议

限定检索结果

文献类型

  • 2,066 篇 期刊文献
  • 816 篇 会议
  • 41 篇 学位论文
  • 6 册 图书
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 2,315 篇 工学
    • 2,073 篇 计算机科学与技术...
    • 515 篇 软件工程
    • 347 篇 电气工程
    • 130 篇 土木工程
    • 129 篇 信息与通信工程
    • 129 篇 建筑学
    • 129 篇 测绘科学与技术
    • 77 篇 控制科学与工程
    • 33 篇 电子科学与技术(可...
    • 20 篇 生物工程
    • 20 篇 网络空间安全
    • 18 篇 材料科学与工程(可...
    • 14 篇 仪器科学与技术
    • 11 篇 化学工程与技术
    • 10 篇 石油与天然气工程
    • 10 篇 交通运输工程
    • 10 篇 生物医学工程(可授...
  • 1,052 篇 理学
    • 943 篇 数学
    • 81 篇 统计学(可授理学、...
    • 62 篇 生物学
    • 52 篇 物理学
    • 27 篇 化学
    • 20 篇 系统科学
  • 188 篇 管理学
    • 138 篇 管理科学与工程(可...
    • 61 篇 图书情报与档案管...
    • 37 篇 工商管理
  • 35 篇 经济学
    • 34 篇 应用经济学
  • 32 篇 医学
    • 16 篇 临床医学
    • 10 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 8 篇 教育学
  • 8 篇 文学
  • 7 篇 农学
  • 1 篇 艺术学

主题

  • 2,930 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 94 篇 parallel algorit...
  • 66 篇 computational co...
  • 65 篇 graph theory
  • 55 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 50 篇 analysis of algo...
  • 45 篇 shortest paths
  • 45 篇 planar graphs
  • 44 篇 treewidth
  • 38 篇 social networks
  • 37 篇 distributed comp...
  • 36 篇 data structures
  • 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 ...
  • 14 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 10 篇 technion israel ...
  • 9 篇 univ vienna fac ...
  • 9 篇 brno university ...
  • 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...

作者

  • 31 篇 xiao mingyu
  • 22 篇 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,643 篇 英文
  • 278 篇 其他
  • 8 篇 中文
  • 2 篇 德文
  • 2 篇 斯洛文尼亚文
  • 1 篇 法文
  • 1 篇 土耳其文
检索条件"主题词=graph algorithms"
2930 条 记 录,以下是111-120 订阅
排序:
An Overview of Neutrosophic graphs
收藏 引用
Neutrosophic Sets and Systems 2025年 77卷 450-462页
作者: Panda, Nihar Ranjan Raut, Prasanta Kumar Baral, Amarendra Sahoo, Srikanta Kumar Satapathy, Sakya Singh Broumi, Said IMS & SUM Hospital Siksha o Anusandhan Deemed to be University India Department of Mathematics Trident Academy of Technology Odisha Bhubaneswar India National Institute of Technology Agartala India Laboratory of Information Processing Faculty of Science Ben M’Sik University Hassan II Casablanca Morocco
A new area of study called "neutrosophic graph theory" uses neutrosophic logic to expand on traditional graph theory to include ambiguous, indeterminate, and uncertain information. This paper gives a thoroug... 详细信息
来源: 评论
An Approach for Residuals Generation based on Structural Analysis and Genetic Algorithm
EEA - Electrotehnica, Electronica, Automatica
收藏 引用
EEA - Electrotehnica, Electronica, Automatica 2025年 第1期73卷 91-95页
作者: Sabrina, Abid University of Mustapha Stambouli Mascara PO Box 05 Route Mamounia Mascara Mascara29000 Algeria
The world of industry has increasingly complex efficient machines and installations, the fault detection and isolation procedure is an essential module used to guarantee the continued functioning of the systems in the... 详细信息
来源: 评论
Temporal betweenness centrality on shortest walks variants
收藏 引用
APPLIED NETWORK SCIENCE 2025年 第1期10卷 1-25页
作者: Naima, Mehdi Sorbonne Univ LIP6 CNRS F-75005 Paris France
Betweenness centrality has been extensively studied since its introduction in 1977 as a measure of node importance in graphs. This measure has found use in various applications and has been extended to temporal graphs... 详细信息
来源: 评论
Efficient algorithms for Minimizing the Kirchhoff Index via Adding Edges
收藏 引用
IEEE Transactions on Knowledge and Data Engineering 2025年 第6期37卷 3342-3355页
作者: Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China School of Computing Australian National University CanberraACT2601 Australia Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China
The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this pape... 详细信息
来源: 评论
graphCT: Multithreaded algorithms for Massive graph Analysis
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2013年 第11期24卷 2220-2229页
作者: Ediger, David Jiang, Karl Riedy, E. Jason Bader, David A. Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA
The digital world has given rise to massive quantities of data that include rich semantic and complex networks. A social graph, for example, containing hundreds of millions of actors and tens of billions of relationsh... 详细信息
来源: 评论
VLP: A Label Propagation Algorithm for Community Detection in Complex Networks  16th
VLP: A Label Propagation Algorithm for Community Detection i...
收藏 引用
16th International Conference on Social Networks Analysis and Mining
作者: Boddu, Sharon Khan, Maleq Nijim, Mais Texas A&M Univ Dept Elect Engn & Comp Sci Kingsville TX 78363 USA
Community detection is a commonly encountered problem in social network analysis and many other areas. A community in a graph or network is a subgraph containing vertices that are closely connected to other vertices w... 详细信息
来源: 评论
Evaluating and Improving Projects' Bus-Factor: A Network Analytical Framework  16th
Evaluating and Improving Projects' Bus-Factor: A Network Ana...
收藏 引用
16th International Conference on Social Networks Analysis and Mining
作者: Piccolo, Sebastiano A. De Meo, Pasquale Terracina, Giorgio Univ Calabria Dept DeMaCS Arcavacata Di Rende CS Italy Univ Messina Dept DICAM Messina ME Italy
When enough people leave a project, the project might stall due to lack of knowledgeable personnel. The minimum number of people who are required to disappear in order for a project to stall is referred to as bus-fact... 详细信息
来源: 评论
graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
收藏 引用
Proceedings of the ACM on Management of Data 2025年 第1期3卷 1-31页
作者: Ilias Azizi Karima Echihabi Themis Palpanas UM6P Ben Guerir Morocco and Université Paris Cité Paris France UM6P Ben Guerir Morocco Université Paris Cité Paris France
Vector data is prevalent across business and scientific applications, and its popularity is growing with the proliferation of learned embeddings. Vector data collections often reach billions of vectors with thousands ... 详细信息
来源: 评论
On Mining Dynamic graphs for k Shortest Paths  16th
On Mining Dynamic Graphs for k Shortest Paths
收藏 引用
16th International Conference on Social Networks Analysis and Mining
作者: D'Ascenzo, Andrea D'Emidio, Mattia Luiss Univ Rome Italy Univ Aquila Laquila Italy
Mining graphs, upon query, for k shortest paths between vertex pairs is a prominent primitive to support several analytics tasks on complex networked datasets. The state-of-the-art method to implement this primitive i... 详细信息
来源: 评论
EFFICIENT FALSE PATH ELIMINATION algorithms FOR TIMING VERIFICATION BY EVENT graph PREPROCESSING
收藏 引用
INTEGRATION-THE VLSI JOURNAL 1989年 第2期8卷 173-187页
作者: CLAESEN, L SCHUPP, JP DAS, P JOHANNES, P PERREMANS, S DEMAN, H INTERUNIV MICROELECTR CTR VLSI SYST DESIGN METHODOL GRPB-3030 LOUVAINBELGIUM
Accurate timing verification and optimization methods require algorithms that exclude false paths. Recently published methods for critical path searches that eliminate false paths, can take long evaluation times for c... 详细信息
来源: 评论