咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是341-350 订阅
排序:
Grid graph-based large-scale point clouds registration
收藏 引用
International Journal of Digital Earth 2023年 第1期16卷 2448-2466页
作者: Yi Han Guangyun Zhang Rongting Zhang School of Geomatics Science and Technology Nanjing Tech UniversityNanjingPeople's Republic of China
Automatic registration of unordered point clouds is the prerequisite forurban reconstruction. However, most of the existing technologies stillsuffer from some limitations. On one hand, most of them are sensitive tonoi... 详细信息
来源: 评论
A 2D geometric constraint solver using a graph reduction method
收藏 引用
ADVANCES IN ENGINEERING SOFTWARE 2010年 第10-11期41卷 1187-1194页
作者: Ait-Aoudia, Samy Foufou, Sebti Ecole Natl Super Informat Algiers 16270 Algeria CNRS Lab LE2i UMR 5158 F-21078 Dijon France
Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design in... 详细信息
来源: 评论
A PROBE-based heuristic for graph partitioning
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2007年 第12期56卷 1707-1720页
作者: Chardaire, Pierre Barake, Musbah McKeown, Geoff P. Univ E Anglia Sch Comp Sci Norwich NR4 7TJ Norfolk England Amer Univ Beirut Suliman S Olayan Sch Business Beirut Lebanon
A new heuristic algorithm, PROBE_BA, which is based on the recently introduced metaheuristic paradigm Population-Reinforced Optimization-Based Exploration (PROBE), is proposed for solving the graph Partitioning Proble... 详细信息
来源: 评论
Formal Derivation of graph AlgorithmicPrograms Using Partition-and-Recur
收藏 引用
Journal of Computer Science & Technology 1998年 第6期13卷 553-561页
作者: 薛锦云 Computer Software Institute Jiangxi Normal University Nanchang P. R. China
In this paper, we derive, by presenting some suitable notations, three typical graph algorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than th... 详细信息
来源: 评论
Solving graph theory problems using reconfigurable pipelined optical buses
收藏 引用
PARALLEL COMPUTING 2000年 第6期26卷 723-735页
作者: Li, KQ Pan, Y Hamdi, M Hong Kong Univ Sci & Technol Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Dayton Dept Comp Sci Dayton OH 45469 USA SUNY Albany Dept Math & Comp Sci New Paltz NY 12561 USA
We serve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value ... 详细信息
来源: 评论
graph-based analysis of human transfer learning using a game testbed
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2007年 第11期19卷 1465-1478页
作者: Cook, Diane J. Holder, Lawrence B. Youngblood, G. Michael Washington State Univ Sch Elect Engn & Comp Sci Pullman WA 99164 USA Univ N Carolina Dept Comp Sci Charlotte NC 28223 USA
The ability to transfer knowledge learned in one environment in order to improve performance in a different environment is one of the hallmarks of human intelligence. Insights into human transfer learning help us to d... 详细信息
来源: 评论
Linear Programming Formulations for Computing graph Layout Parameters
收藏 引用
COMPUTER JOURNAL 2015年 第11期58卷 2921-2927页
作者: Gurski, Frank Univ Dusseldorf Inst Comp Sci Algorithm Hard Problems Grp D-40225 Dusseldorf Germany
Luttamguzi et al. [(2005) Integer Programming Methods for Several Optimization Problems in graph Theory. Proc. Int. Conf. Computers and Their Applications, CATA 2005, New Orleans, LA, USA, March 16-18, pp. 50-55. ISCA... 详细信息
来源: 评论
Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph
收藏 引用
ALGORITHMICA 1996年 第3期15卷 242-255页
作者: Easwarakumar, KS Krishnan, SV Rangan, CP Seshadri, S INDIAN INST TECHNOL DEPT COMP SCI & ENGN MADRAS 600036 TAMIL NADU INDIA
A cycle C passing through two specific vertices s and t of a biconnected graph is said to be an st-ambitus if its bridges do not interlace in some special way. We present algorithms for st-ambitus for planar biconnect... 详细信息
来源: 评论
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
收藏 引用
INFORMATION PROCESSING LETTERS 2016年 第6期116卷 433-436页
作者: Barbero, Florian Gutin, Gregory Jones, Mark Sheng, Bin Yeo, Anders Lab Informat Robot & Microelect Montpellier 161 Rue Ada F-34095 Montpellier 5 France Univ London Dept Comp Sci Royal Holloway Egham TW20 0EX Surrey England Singapore Univ Technol & Design Engn Syst & Design Singapore Singapore Univ Johannesburg Dept Math ZA-2006 Auckland Pk South Africa
Let integers r >= 2 and d >= 3 be fixed. Let g(d) be the set of graphs with no induced path on d vertices. We study the problem of packing k vertex-disjoint copies of K-1,K-r, (k >= 2) into a graph G from par... 详细信息
来源: 评论
ON THE POWER OF graph SEARCHING FOR COCOMPARABILITY graphS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第1期30卷 569-591页
作者: Corneil, Derek G. Dusart, Jeremie Habib, Michel Koehler, Ekkehard Univ Toronto Dept Comp Sci Toronto ON M5S3G4 Canada CNRS UMR 7089 LIAFA F-75205 Paris 13 France Univ Paris Diderot F-75205 Paris 13 France Brandenburg Tech Univ Cottbus Math Inst D-03044 Cottbus Germany
In this paper we study how graph searching on a cocomparability graph G can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of G) that yield simple algori... 详细信息
来源: 评论