咨询与建议

限定检索结果

文献类型

  • 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,638 篇 英文
  • 286 篇 其他
  • 7 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2936 条 记 录,以下是2861-2870 订阅
排序:
BLOCKING SMALL CUTS IN A NETWORK, AND RELATED PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 1993年 第3期22卷 482-499页
作者: BIENSTOCK, D DIAZ, N Columbia Univ New York NY USA
Let G be a graph with weights on the edges, S a subset of vertices, and k an integer. The problem of computing a minimum-weight subset of edges that meets all the cuts of cardinality less-than-or-equal-to k that separ... 详细信息
来源: 评论
DETERMINING UNI-CONNECTIVITY IN DIRECTED-graphS
收藏 引用
INFORMATION PROCESSING LETTERS 1993年 第1期48卷 9-12页
作者: BUCHSBAUM, AL CARLISLE, MC Department of Computer Science Princeton University 35 Olden Street Princeton NJ 08544 USA
We consider the problem of determining whether a directed graph contains a pair of vertices connected by two distinct simple paths. A straightforward implementation using n depth-first searches requires O(nm) time on ... 详细信息
来源: 评论
A LINEAR ALGORITHM FOR THE GROUP PATH PROBLEM ON CHORDAL graphS
收藏 引用
DISCRETE APPLIED MATHEMATICS 1993年 第1-3期44卷 185-190页
作者: ARIKATI, SR PELED, UN Department of Mathematics Statistics and Computer Science University of Illinois at Chicago Box 4348 Chicago IL 60680 USA
Assume that each edge of a graph G=(V,E) is given a weight, which is an element of some group G. The weight of a path P is defined as the product of the weights of the edges along P. The group path problem is to find ... 详细信息
来源: 评论
DOMINATION ON COCOMPARABILITY graphS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1993年 第3期6卷 400-417页
作者: KRATSCH, D STEWART, L UNIV ALBERTA DEPT COMP SCIEDMONTON T6G 2H1ABCANADA UNIV TORONTO TORONTO M5S 1A1ONTARIOCANADA
The authors determine the algorithmic complexity of domination and variants on cocomparability graphs, a class of perfect graphs containing both the interval and the permutation graphs. Minimum dominating total domina... 详细信息
来源: 评论
THE PATHWIDTH AND TREEWIDTH OF COgraphS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1993年 第2期6卷 181-188页
作者: BODLAENDER, HL MOHRING, RH TECH UNIV BERLIN DEPT MATHW-1000 BERLIN 12GERMANY
It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.
来源: 评论
algorithms FOR FINDING THE LARGEST SUBTREE WHOSE COPIES COVER ALL THE LEAVES
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1993年 第6期E76D卷 707-710页
作者: AKUTSU, T KOBAYASHI, S HORI, K OHSUGA, S Mechanical Engineering Lab Tsukuba-shi Japan
This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S1, ... , S(k) (k > 1) of T each of which is isomorphic to S and every leaf of T is a leaf of som... 详细信息
来源: 评论
A MINIMUM PATH DECOMPOSITION OF THE HASSE DIAGRAM FOR TESTING THE CONSISTENCY OF FUNCTIONAL-DEPENDENCIES
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1993年 第2期E76D卷 299-301页
作者: TAKASU, A AKUTSU, T Natl Cent for Science Information Systems Tokyo Japan
An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.
来源: 评论
Characterizing and Generating Bivariate Empirical Rank Distributions Satisfying Certain Positive Dependence Concepts
收藏 引用
Journal of Computational and graphical Statistics 1993年 第2期2卷 209-223页
作者: Metry, Magdy H. Sampson, Allan R. Department of Mathematical Sciences University of Northern Colorado Greeley CO 80639 United States Department of Mathematics and Statistics University of Pittsburgh Pittsburgh PA 15260 United States
This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the ... 详细信息
来源: 评论
CONDITIONS FOR UNIQUE graph REALIZATIONS
收藏 引用
SIAM JOURNAL ON COMPUTING 1992年 第1期21卷 65-84页
作者: HENDRICKSON, B Sandia Natl Lab Albuquerque
The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paper is concerned with ... 详细信息
来源: 评论
EXPECTED PARALLEL TIME AND SEQUENTIAL SPACE COMPLEXITY OF graph AND DIgraph PROBLEMS
收藏 引用
ALGORITHMICA 1992年 第5-6期7卷 597-630页
作者: REIF, J SPIRAKIS, P COMP TECHNOL INST GR-26110 PATRASGREECE NYU COURANT INST MATH SCIDEPT COMP SCINEW YORKNY 10003
This paper determines upper bounds on the expected time complexity for a variety of parallel algorithms for undirected and directed random graph problems. For connectivity, biconnectivity, transitive closure, minimum ... 详细信息
来源: 评论