咨询与建议

限定检索结果

文献类型

  • 360 篇 期刊文献
  • 145 篇 会议
  • 10 篇 学位论文

馆藏范围

  • 515 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 406 篇 工学
    • 378 篇 计算机科学与技术...
    • 93 篇 软件工程
    • 63 篇 电气工程
    • 23 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 15 篇 控制科学与工程
    • 6 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 光学工程
  • 210 篇 理学
    • 188 篇 数学
    • 13 篇 生物学
    • 7 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 37 篇 管理学
    • 34 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 12 篇 医学
    • 6 篇 临床医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 特种医学
  • 2 篇 文学
    • 2 篇 新闻传播学
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学

主题

  • 515 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 16 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 12 篇 minimum spanning...
  • 12 篇 shortest path
  • 11 篇 chordal graph
  • 11 篇 combinatorial op...
  • 10 篇 gpu
  • 9 篇 graph theory
  • 9 篇 ordering
  • 9 篇 network optimiza...
  • 8 篇 planar graph
  • 8 篇 interval graphs
  • 8 篇 reordering algor...
  • 8 篇 parallel algorit...
  • 7 篇 apx-complete

机构

  • 13 篇 tohoku univ grad...
  • 10 篇 univ elect sci &...
  • 7 篇 kyoto univ grad ...
  • 6 篇 indian inst tech...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 5 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 4 篇 univ sydney sch ...
  • 4 篇 osaka prefecture...
  • 4 篇 univ tokushima d...
  • 4 篇 mit comp sci & a...
  • 4 篇 otaru univ dept ...
  • 4 篇 univ bergen dept...
  • 4 篇 univ helsinki de...
  • 4 篇 shandong univ sc...
  • 3 篇 georgia inst tec...
  • 3 篇 tsinghua univ de...
  • 3 篇 bell laboratorie...

作者

  • 25 篇 ito takehiro
  • 19 篇 nagamochi hirosh...
  • 16 篇 panda b. s.
  • 13 篇 ono hirotaka
  • 10 篇 zhou xiao
  • 10 篇 tarjan re
  • 9 篇 pandey arti
  • 9 篇 xiao mingyu
  • 8 篇 ishii toshimasa
  • 8 篇 otachi yota
  • 7 篇 suzuki akira
  • 7 篇 morsy ehab
  • 6 篇 uno yushi
  • 6 篇 zhang zhongzhi
  • 5 篇 paul s.
  • 5 篇 cui bin
  • 5 篇 kawahara jun
  • 5 篇 qin lu
  • 5 篇 chen lei
  • 5 篇 lin xuemin

语言

  • 456 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph algorithm"
515 条 记 录,以下是171-180 订阅
排序:
An algorithm for shortest paths in bipartite digraphs with concave weight matrices and its applications
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第1期29卷 65-80页
作者: He, X Chen, ZZ SUNY Buffalo Dept Comp Sci Buffalo NY 14260 USA Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 35003 Japan
The traveling salesman problem on an n-point convex polygon and the minimum latency tour problem for n points on a straight line are two basic problems in graph theory and have been studied in the past. Previously, it... 详细信息
来源: 评论
Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks
收藏 引用
KNOWLEDGE AND INFORMATION SYSTEMS 2016年 第1期46卷 213-239页
作者: Nirmala, Parisutham Sulochana, Lekshmi Ramasubramony Rethnasamy, Nadarajan PSG Coll Technol Dept Appl Math & Computat Sci Coimbatore 641004 Tamil Nadu India
Communication networks are ubiquitous, increasingly complex, and dynamic. Predicting and visualizing common patterns in such a huge graph data of communication network is an essential task to understand active pattern... 详细信息
来源: 评论
Exact algorithms for weak Roman domination
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 248卷 79-92页
作者: Chapelle, Mathieu Cochefert, Manfred Couturier, Jean-Francois Kratsch, Dieter Letourneur, Romain Liedloff, Mathieu Perez, Anthony IFTS CReSTIC Pole Haute Technol F-08000 Charleville Mezieres France Univ Lorraine Lab Informat Theor & Appl F-57045 Metz 01 France Univ Orleans INSA Ctr Val Loire LIFO EA 4022 FR-45067 Orleans France
We consider the WEAK ROMAN DOMINATION problem. Given an undirected graph G = (V, E), the aim is to find a weak Roman domination function (wrd-function for short) of minimum cost, i.e. a function f : V -> {0, 1, 2} ... 详细信息
来源: 评论
Route planning with turn restrictions: A computational experiment
收藏 引用
OPERATIONS RESEARCH LETTERS 2012年 第5期40卷 342-348页
作者: Vanhove, Stephanie Fack, Veerle Univ Ghent Dept Appl Math & Comp Sci B-9000 Ghent Belgium
Real-world road networks often contain turn penalties or forbidden turns. Standard shortest path algorithms do not take these into account. Several ways of dealing with such turn restrictions have been proposed. It ha... 详细信息
来源: 评论
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time
收藏 引用
ACM TRANSACTIONS ON algorithmS 2024年 第1期20卷 1-26页
作者: Cairo, Massimo Rizzi, Romeo Tomescu, Alexandru I. Zirondelli, Elia C. Univ Helsinki Dept Comp Sci POB 68 FI-00014 Helsinki Finland Univ Verona Dept Comp Sci CaVignal 2Str Grazie 15 I-37134 Verona Italy Univ Trento Dept Math Via Sommar 14 I-38123 Povo Italy
Genome assembly asks to reconstruct an unknown string from many shorter substrings of it. Even though it is one of the key problems in Bioinformatics, it is generally lacking major theoretical advances. Its hardness s... 详细信息
来源: 评论
Leveraging health social networking communities in translational research
收藏 引用
JOURNAL OF BIOMEDICAL INFORMATICS 2011年 第4期44卷 536-544页
作者: Webster, Yue W. Dow, Ernst R. Koehler, Jacob Gudivada, Ranga C. Palakal, Mathew J. Eli Lilly & Co Lilly Corp Ctr Discovery Informat Indianapolis IN 46285 USA Indiana Univ Purdue Univ Sch Informat Indianapolis IN USA
Health social networking communities are emerging resources for translational research. We have designed and implemented a framework called HyGen, which combines Semantic Web technologies, graph algorithms and user pr... 详细信息
来源: 评论
The hidden algorithm of Ore's theorem on Hamiltonian cycles
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 1997年 第11期34卷 113-119页
作者: Palmer, EM Department of Mathematics Michigan State University East Lansing MI 48824 USA palmer@math.msu.edu
In 1960, Ore found a simple sufficient condition for a graph to have a Hamiltonian cycle. We expose a heuristic algorithm, hidden in Ore's proof, which can be very effective in actually finding such a cycle. This ... 详细信息
来源: 评论
Hardness results and approximation algorithm for total liar's domination in graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2014年 第4期27卷 643-662页
作者: Panda, B. S. Paul, S. Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India
In this paper, we initiate the study of total liar's domination of a graph. A subset LaS dagger V of a graph G=(V,E) is called a total liar's dominating set of G if (i) for all vaV, |N (G) (v)a (c) L|a parts p... 详细信息
来源: 评论
algorithms solving the Matching Cut problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 第Part2期609卷 328-335页
作者: Kratsch, Dieter Van Bang Le Univ Lorraine Lab Informat Theor & Appl F-57045 Metz 01 France Univ Rostock Inst Informat D-18055 Rostock Germany
In a graph, a matching cut is an edge cut that is a matching. MATCHING CUT is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete. This paper provides a first bran... 详细信息
来源: 评论
AN O(N LOG2 N) algorithm FOR MAXIMUM FLOW IN UNDIRECTED PLANAR NETWORKS
收藏 引用
SIAM JOURNAL ON COMPUTING 1985年 第3期14卷 612-624页
作者: HASSIN, R JOHNSON, DB PENN STATE UNIV DEPT COMP SCIUNIVERSITY PKPA 16802
A new algorithm is given to find a maximum flow in an undirected planar flow network in $O(n\log ^2 n)$ time, which is faster than the best method previously known by a factor of $\sqrt n /\log n$. The algorithm const... 详细信息
来源: 评论