咨询与建议

限定检索结果

文献类型

  • 2,094 篇 期刊文献
  • 822 篇 会议
  • 24 篇 学位论文
  • 7 册 图书
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

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

主题

  • 2,948 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 96 篇 parallel algorit...
  • 65 篇 computational co...
  • 63 篇 graph theory
  • 58 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 49 篇 analysis of algo...
  • 46 篇 planar graphs
  • 44 篇 shortest paths
  • 44 篇 treewidth
  • 39 篇 social networks
  • 36 篇 data structures
  • 36 篇 distributed comp...
  • 33 篇 distributed algo...
  • 30 篇 complexity
  • 29 篇 parameterized al...
  • 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 篇 natl inst inform...
  • 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 篇 tel aviv univ sc...
  • 8 篇 national univers...

作者

  • 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 篇 dondi riccardo
  • 10 篇 nagamochi hirosh...
  • 10 篇 low tze meng
  • 10 篇 dragan feodor f.

语言

  • 2,328 篇 英文
  • 612 篇 其他
  • 8 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2948 条 记 录,以下是1881-1890 订阅
排序:
Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut  14
Brief Announcement: Almost-Tight Approximation Distributed A...
收藏 引用
ACM Symposium on Principles of Distributed Computing (PODC)
作者: Nanongkai, Danupon Univ Vienna Fac Comp Sci Vienna Austria
In this short paper, we present an improved algorithm for approximating the minimum cut on distributed (CONGEST) networks. Let lambda be the minimum cut. Our algorithm can compute lambda exactly in (O)over tilde ((roo... 详细信息
来源: 评论
Distributed Approximation algorithms for Weighted Shortest Paths  14
Distributed Approximation Algorithms for Weighted Shortest P...
收藏 引用
46th Annual ACM Symposium on Theory of Computing (STOC)
作者: Nanongkai, Danupon Brown Univ ICERM Providence RI 02912 USA Nanyang Technol Univ Singapore 637371 Singapore
A distributed network is modeled by a graph having n nodes (processors) and diameter D. We study the time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O(log n) bandwi... 详细信息
来源: 评论
High Quality, Scalable and Parallel Community Detection for Large Real graphs  14
High Quality, Scalable and Parallel Community Detection for ...
收藏 引用
23rd International Conference on World Wide Web (WWW)
作者: Prat-Perez, Arnau Dominguez-Sal, David Larriba-Pey, Josep-LLuis UPC DAMA Barcelona Spain Spars Technol Barcelona Spain
Community detection has arisen as one of the most relevant topics in the field of graph mining, principally for its applications in domains such as social or biological networks analysis. Different community detection... 详细信息
来源: 评论
Scalable and High Performance Betweenness Centrality on the GPU  14
Scalable and High Performance Betweenness Centrality on the ...
收藏 引用
International Conference on High Performance Computing, Networking, Storage and Analysis
作者: McLaughlin, Adam Bader, David A. Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA
graphs that model social networks, numerical simulations, and the structure of the Internet are enormous and cannot be manually inspected. A popular metric used to analyze these networks is betweenness centrality, whi... 详细信息
来源: 评论
Counting Homomorphisms to Cactus graphs Modulo 2  31
Counting Homomorphisms to Cactus Graphs Modulo 2
收藏 引用
31st International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Gobel, Andreas Goldberg, Leslie Ann Richerby, David Univ Oxford Dept Comp Sci Oxford England
A homomorphism from a graph G to a graph H is a function from V(G) to V(H) that preserves edges. Many combinatorial structures that arise in mathematics and computer science can be represented naturally as graph homom... 详细信息
来源: 评论
Exploratory Equivalence in graphs: Definition and algorithms
Exploratory Equivalence in Graphs: Definition and Algorithms
收藏 引用
Federated Conference on Computer Science and Information Systems (FedCSIS)
作者: Mihelic, Jurij Fuerst, Luka Cibej, Uros Univ Ljubljana Fac Comp & Informat Sci SI-1000 Ljubljana Slovenia
Motivated by improving the efficiency of pattern matching on graphs, we define a new kind of equivalence on graph vertices. Since it can be used in various graph algorithms that explore graphs, we call it exploratory ... 详细信息
来源: 评论
Join-Reachability Problems in Directed graphs
Join-Reachability Problems in Directed Graphs
收藏 引用
6th International Computer Science Symposium in Russia (CSR)
作者: Georgiadis, Loukas Nikolopoulos, Stavros D. Palios, Leonidas Univ Ioannina Dept Comp Sci GR-45110 Ioannina Greece
For a given collection of directed graphs we define the join-reachability graph of , denoted by , as the directed graph that, for any pair of vertices u and v, contains a path from u to v if and only if such a path ex... 详细信息
来源: 评论
Load-Balanced Breadth-First Search on GPUs
Load-Balanced Breadth-First Search on GPUs
收藏 引用
15th International Conference on Web-Age Information Management (WAIM)
作者: Zhu, Zhe Li, Jianjun Li, Guohui Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Peoples R China
Breadth-first search (BFS) is widely used in web link and social network analysis as well as other fields. The graphics Processing Unit (GPU) has been demonstrated to have great potential in accelerating graph algorit... 详细信息
来源: 评论
Sending Secrets Swiftly: Approximation algorithms for Generalized Multicast Problems
Sending Secrets Swiftly: Approximation Algorithms for Genera...
收藏 引用
41st International Colloquium on Automata, Languages and Programming
作者: Nikzad, Afshin Ravi, R. Stanford Univ MS&E Dept Stanford CA 94305 USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
We consider natural generalizations of the minimum broadcast time problem under the telephone model, where a rumor from a root node must be sent via phone calls to the whole graph in the minimum number of rounds;the t... 详细信息
来源: 评论
NVM-based Hybrid BFS with Memory Efficient Data Structure  2
NVM-based Hybrid BFS with Memory Efficient Data Structure
收藏 引用
IEEE International Conference on Big Data
作者: Iwabuchi, Keita Sato, Hitoshi Yasui, Yuichiro Fujisawa, Katsuki Matsuoka, Satoshi Tokyo Inst Technol Tokyo Japan Kyushu Univ Fukuoka Japan Japan Sci & Technol Agcy CREST Kawaguchi Saitama Japan
We introduce a memory efficient implementation for the NVM-based Hybrid BFS algorithm that merges redundant data structures to a single graph data structure, while offloading infrequent accessed graph data on NVMs bas... 详细信息
来源: 评论