咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是261-270 订阅
排序:
Parameterized Complexity of Weighted Target Set Selection  18th
Parameterized Complexity of Weighted Target Set Selection
收藏 引用
18th Annual Conference on Theory and Applications of Models of Computation (TAMC)
作者: Suzuki, Takahiro Kimura, Kei Suzuki, Akira Tamura, Yuma Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Japan Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka Japan
Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the number of active vertices adjacent to v is at least as many as its threshold. A vertex subset A(0) of G is a target set if even... 详细信息
来源: 评论
Approximating Single-Source Personalized PageRank with Absolute Error Guarantees  27
Approximating Single-Source Personalized PageRank with Absol...
收藏 引用
27th International Conference on Database Theory (ICDT)
作者: Wei, Zhewei Wen, Ji-Rong Yang, Mingji Renmin Univ China Beijing Peoples R China
Personalized PageRank (PPR) is an extensively studied and applied node proximity measure in graphs. For a pair of nodes s and t on a graph G = (V, E), the PPR value pi(s, t) is defined as the probability that an alpha... 详细信息
来源: 评论
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques  2024
Towards Optimal Output-Sensitive Clique Listing or: Listing ...
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Dalirrooyfard, Mina Mathialagan, Surya Williams, Virginia Vassilevska Xu, Yinzhan Morgan Stanley Res Calgary AB Canada MIT 77 Massachusetts Ave Cambridge MA 02139 USA
We study the problem of finding and listing k-cliques in an m-edge, n-vertex graph, for constant k >= 3. This is a fundamental problem of both theoretical and practical importance. Our first contribution is an algo... 详细信息
来源: 评论
Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery
收藏 引用
ACM TRANSACTIONS ON PARALLEL COMPUTING 2023年 第2期10卷 1-35页
作者: Lakhotia, Kartik Kannan, Rajgopal Prasanna, Viktor Univ Southern Calif Los Angeles CA 90007 USA US Army Res Lab Adelphi MD USA
Wing and Tip decomposition are motif-based analytics for bipartite graphs that construct a hierarchy of butterfly (2,2-biclique) dense edge and vertex induced subgraphs, respectively. They have applications in several... 详细信息
来源: 评论
algorithms for computing chromatic polynomials and chromatic index polynomials
收藏 引用
SCIENTIFIC AFRICAN 2024年 24卷
作者: Hordofa, Lateram Zawuga Repalle, V. N. SrinivasaRao Ashebo, Mamo Abebe Wollega Univ Dept Math Post Box 395 Nekemte Ethiopia
Objectives: The aim of this article is to enhance the understanding of the computation of chromatic polynomials and chromatic index polynomials, and to facilitate their practical use in various fields by demonstrating... 详细信息
来源: 评论
A Fully Physics-Based CMOS Camera Model Within a 3-D Virtual World Ray Trace Simulation Engine
收藏 引用
SN Computer Science 2024年 第1期5卷 61页
作者: Pecharromán-Gallego, Raúl Ibeo Automotive Eindhoven B.V. High Tech Campus 69 Eindhoven 5656 AG Netherlands
CMOS based cameras are present nowadays for many imaging applications, ranging from any consumer, industrial or artistic use, they will also be introduced into the simulation engines applied to any raytracing technolo... 详细信息
来源: 评论
A Robust Network Model for Studying Microbiomes in Precision Agriculture Applications  24th
A Robust Network Model for Studying Microbiomes in Precision...
收藏 引用
24th International Conference on Computational Science (ICCS)
作者: Kim, Suyeon Thapa, Ishwor Ali, Hesham H. Univ Nebraska Coll Informat Sci & Technol Omaha NE 68182 USA
Recent rapid advancements in high-throughput sequencing technologies have made it possible for researchers to explore the microbial universe in high degrees of depth that were not possible even few years ago. Microbia... 详细信息
来源: 评论
Knapsack: Connectedness, Path, and Shortest-Path  16th
Knapsack: Connectedness, Path, and Shortest-Path
收藏 引用
16th Latin American Symposium on Theoretical Informatics (LATIN)
作者: Dey, Palash Kolay, Sudeshna Singh, Sipra Indian Inst Technol Kharagpur Kharagpur W Bengal India
We study the KNAPSACK problem with graph-theoretic constraints. That is, there exists a graph structure on the input set of items of KNAPSACK and the solution also needs to satisfy certain graph theoretic properties o... 详细信息
来源: 评论
A Framework for Parallelizing Approximate Gaussian Elimination  24
A Framework for Parallelizing Approximate Gaussian Eliminati...
收藏 引用
36th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)
作者: Baumann, Yves Kyng, Rasmus Swiss Fed Inst Technol Zurich Switzerland
In a breakthrough result, Spielman and Teng (2004) developed a nearly-linear time solver for Laplacian linear equations, i.e. equations where the coefficient matrix is symmetric with non-negative diagonals and zero ro... 详细信息
来源: 评论
New Structures and algorithms for Length-Constrained Expander Decompositions  65
New Structures and Algorithms for Length-Constrained Expande...
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Haeupler, Bernhard Hershkowitz, D. Ellis Tan, Zihan Univ Sofia St Kliment Ohridski INSAIT Sofia Bulgaria Swiss Fed Inst Technol Zurich Switzerland Brown Univ Providence RI 02912 USA Rutgers State Univ New Brunswick NJ USA
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems w... 详细信息
来源: 评论