咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 2,935 篇 电子文献
  • 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,936 篇 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 篇 shortest paths
  • 45 篇 planar graphs
  • 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 篇 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
  • 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,637 篇 英文
  • 287 篇 其他
  • 7 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2936 条 记 录,以下是261-270 订阅
排序:
BETTI NUMBERS OF NORMAL EDGE RINGS (II)
arXiv
收藏 引用
arXiv 2025年
作者: Wang, Zexin Lu, Dancheng School of Mathematical Sciences Soochow University Suzhou215006 China
We compute the Betti numbers of the edge rings of multi-path graphs using the induced-subgraph method introduced in [19]. Here, a multi-path graph refers to a simple graph consisting of two vertices and multiple paths... 详细信息
来源: 评论
Degree-Based Logical Adjacency Checking (DBLAC): A Novel Heuristic for Vertex Coloring
arXiv
收藏 引用
arXiv 2025年
作者: Verma, Prashant Patna India
Degree Based Logical Adjacency Checking (DBLAC). An efficient coloring of graphs with unique logical AND operations. The logical AND operation shows More effective color assignment and fewer number of induced in the c... 详细信息
来源: 评论
Hierarchical Multicriteria Shortest Path Search
arXiv
收藏 引用
arXiv 2025年
作者: Kurbanov, Temirlan Miao, Linxiao Vokřínek, Jiří The Department of Computer Science Faculty of Electrical Engineering Czech Technical University in Prague Czech Republic
This paper presents a novel multicriteria shortest path search algorithm called Hierarchical MLS. The distinguishing feature of the algorithm is the multilayered structure of compressed k-Path-Cover graphs it operates... 详细信息
来源: 评论
A Note on Mixed Cages of Girth 5
arXiv
收藏 引用
arXiv 2025年
作者: Araujo-Pardo, Gabriela Mendoza-Cadena, Lydia Mirabel Instituto de Matemáticas Universidad Nacional Autónoma de México Campus Juriquilla Querétaro Mexico Center for Mathematical Modeling Universidad de Chile Santiago Chile
A mixed regular graph is a graph where every vertex has z incoming arcs, z outgoing arcs, and r edges;furthermore, if it has girth g, we say that the graph is a [z, r;g]-mixed graph. A [z, r;g]-mixed cage is a [z, r;g... 详细信息
来源: 评论
Twin-width one
arXiv
收藏 引用
arXiv 2025年
作者: Ahn, Jungho Jacob, Hugo Köhler, Noleen Paul, Christophe Reinald, Amadeus Wiederrecht, Sebastian Seoul Korea Republic of LIRMM CNRS Université de Montpellier France University of Leeds United Kingdom School of Computing KAIST Daejeon Korea Republic of
We investigate the structure of graphs of twin-width at most 1, and obtain the following results: graphs of twin-width at most 1 are permutation graphs. In particular they have an intersection model and a linear struc... 详细信息
来源: 评论
A Space Improved Algorithm for Chromatic Number
SSRN
收藏 引用
SSRN 2025年
作者: Wu, Pu Gu, Huanyu Jiang, Huiqin Shao, Zehui Xu, Jin School Of Computer Science Peking University Beijing100871 China Institute Of Computing Science And Technology Guangzhou University GuangDong Guangzhou510006 China Ministry Of Education Beijing100871 China
We investigate the chromatic number problem, a classic NP-complete problem identified by Karp among his 21 seminal problems. The chromatic number of a graph G is the smallest integer k such that each vertex of G can b... 详细信息
来源: 评论
A SHORT PROOF OF GENERALIZED CONWAY–GORDON–SACHS THEOREM
arXiv
收藏 引用
arXiv 2025年
作者: Nikkuni, Ryo Department of Information and Mathematical Sciences School of Arts and Sciences Tokyo Woman’s Christian University 2-6-1 Zempukuji Suginami-ku Tokyo167-8585 Japan
The famous Conway–Gordon–Sachs theorem for the complete graph on six vertices was extended to the general complete graph on n vertices by Kazakov–Korablev as a congruence modulo 2, and its integral lift was given b... 详细信息
来源: 评论
Hosoya Polynomials of Mycielskian graphs
arXiv
收藏 引用
arXiv 2025年
作者: Vaidya, Sanju Li, Aihua Mercy College Dobbs FerryNY555 United States Montclair State University 1 Normal Avenue MontclairNJ07044 United States
Vulnerability measures and topological indices are crucial in solving various problems such as the stability of the communication networks and development of mathematical models for chemical compounds. In 1947, Harry ... 详细信息
来源: 评论
Critical (P5, W4)-Free graphs
arXiv
收藏 引用
arXiv 2025年
作者: Xia, Wen Jooken, Jorik Goedgebeur, Jan Beaton, Iain Cameron, Ben Huang, Shenwei College of Computer Science Nankai University Tianjin300071 China Tianjin Key Laboratory of Network and Data Security Technology Nankai University Tianjin300071 China Department of Computer Science KU Leuven Campus Kulak-Kortrijk Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium Department of Mathematics and Statistics Acadia University WolfvilleNS Canada School of Mathematical and Computational Sciences University of Prince Edward Island CharlottetownPE Canada
A graph G is k-vertex-critical if χ(G) = k but χ(G − v) 1, H2)-free if it contains no induced subgraph isomorphic to H1 nor H2. A W4 is the graph consisting of a C4 plus an additional vertex adjacent to all the vert... 详细信息
来源: 评论
Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
arXiv
收藏 引用
arXiv 2025年
作者: Li, Xiaoyu Liang, Yingyu Long, Jiangxuan Shi, Zhenmei Song, Zhao Zhuang, Zhen University of New South Wales Australia The University of Hong Kong Hong Kong University of Wisconsin-Madison United States South China University of Technology China The Simons Institute for the Theory of Computing The University of California Berkeley United States University of Minnesota United States
Looped Transformers have shown exceptional neural algorithmic reasoning capability in simulating traditional graph algorithms, but their application to more complex structures like hypergraphs remains underexplored. H... 详细信息
来源: 评论