咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是311-320 订阅
排序:
Quantum approaches to graph colouring
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第4-5期410卷 302-309页
作者: D'Hondt, Ellie Vrije Univ Brussel B-1050 Brussels Belgium
In this paper, we investigate quantum algorithms for graph colouring problems, in particular for 2- and 3-colouring of graphs. Our main goal is to establish a set of quantum representations and operations suitable for... 详细信息
来源: 评论
On simultaneous straight-line grid embedding of a planar graph and its dual
收藏 引用
INFORMATION PROCESSING LETTERS 2006年 第1期99卷 1-6页
作者: Zhang, Huaming He, Xin Univ Alabama Dept Comp Sci Huntsville AL 35899 USA SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA
Simultaneous representations of planar graphs and their duals normally require that the dual vertices to be placed inside their corresponding primal faces, and the edges of the dual graph to cross only their correspon... 详细信息
来源: 评论
Finding a minimum path cover of a distance-hereditary graph in polynomial time
收藏 引用
DISCRETE APPLIED MATHEMATICS 2007年 第17期155卷 2242-2256页
作者: Hung, Ruo-Wei Chang, Maw-Shang Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung 413 Taiwan Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi 621 Taiwan
A path cover of a graph G = (V, E) is a set of pairwise vertex-disjoint paths such that the disjoint union of the vertices of these paths equals the vertex set V of G. The path cover problem is, given a graph, to find... 详细信息
来源: 评论
A linear algorithm for finding the invariant edges of an edge-weighted graph
收藏 引用
SIAM JOURNAL ON COMPUTING 2002年 第5期31卷 1438-1455页
作者: Malvestuto, FM Mezzini, M Univ Roma La Sapienza Dipartimento Sci Informaz Rome Italy
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of given and new weights assigned to the ed... 详细信息
来源: 评论
graph-based representation for similarity retrieval of symbolic images
收藏 引用
DATA & KNOWLEDGE ENGINEERING 2008年 第3期65卷 401-418页
作者: Hsieh, Shu-Ming Hsu, Chiun-Chieh Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 10607 Taiwan
Image retrieval from an image database by the image objects and their spatial relationships has emerged as an important research subject in these decades. To retrieve images similar to a given query image, retrieval m... 详细信息
来源: 评论
graph CLASSES AND FORBIDDEN PATTERNS ON THREE VERTICES
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2021年 第1期35卷 55-90页
作者: Feuilloley, Laurent Habib, Michel Univ Chile DII Santiago Chile Paris Univ IRIF F-75205 Paris 13 France Paris Univ INRIA GANG F-75205 Paris 13 France
This paper deals with the characterization and the recognition of graph classes. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortunately, this strategy rarely... 详细信息
来源: 评论
A graph-Based Ontology Matching Framework
收藏 引用
NEW GENERATION COMPUTING 2024年 第1期42卷 33-51页
作者: Senturk, Fatmana Aytac, Vecdi Pamukkale Univ Comp Engn Dept TR-20160 Denizli Turkiye Ege Univ Comp Engn Dept TR-35040 Izmir Turkiye
Ontologies are domain-specific metadata that describe relationships between a specific field's properties, sample data of this field, and properties developed for many different purposes. Also, ontologies can be d... 详细信息
来源: 评论
graph traversals, genes and matroids: an efficient case of the travelling salesman problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 1998年 第1-3期88卷 167-180页
作者: Gusfield, D Karp, R Wang, LS Stelling, P Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA City Univ Hong Kong Dept Comp Sci Kowloon Peoples R China Aerosp Corp El Segundo CA 90245 USA
In this paper we consider graph traversal problems (Euler and Travelling Salesman traversals) that arise from a particular technology for DNA sequencing - sequencing by hybridization (SBH). We first explain the connec... 详细信息
来源: 评论
DAMGNN: Deep adaptive multi-channel graph neural networks
收藏 引用
INTELLIGENT DATA ANALYSIS 2022年 第4期26卷 873-891页
作者: Li, Yuqiang Chen, Wei Liao, Jing Liu, Chun Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China
Recently, several studies have reported that graph Convolutional Networks (GCN) exhibit defects in integrating node features and topological structures in graphs. Although the proposal of AMGCN compensates for the dra... 详细信息
来源: 评论
A graph THEORETIC APPROACH TO STATISTICAL-DATA SECURITY
收藏 引用
SIAM JOURNAL ON COMPUTING 1988年 第3期17卷 552-571页
作者: GUSFIELD, D Univ of California CA United States
In this paper we study the problem of protecting sensitive data in an n by n two-dimensional table of statistics, when the nonsensitive data are made public along with the row and column sums for the table. A sensitiv... 详细信息