咨询与建议

限定检索结果

文献类型

  • 362 篇 期刊文献
  • 146 篇 会议
  • 10 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 409 篇 工学
    • 380 篇 计算机科学与技术...
    • 94 篇 软件工程
    • 64 篇 电气工程
    • 24 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 16 篇 控制科学与工程
    • 6 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 光学工程
  • 212 篇 理学
    • 190 篇 数学
    • 13 篇 生物学
    • 8 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 38 篇 管理学
    • 35 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 12 篇 医学
    • 6 篇 临床医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 特种医学
  • 2 篇 文学
    • 2 篇 新闻传播学
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学

主题

  • 518 篇 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 篇 parallel algorit...
  • 9 篇 network optimiza...
  • 8 篇 planar graph
  • 8 篇 interval graphs
  • 8 篇 reordering algor...
  • 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 篇 fudan univ sch c...
  • 4 篇 univ bergen dept...
  • 4 篇 univ helsinki de...
  • 4 篇 shandong univ sc...
  • 3 篇 georgia inst tec...
  • 3 篇 tsinghua univ de...

作者

  • 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
  • 7 篇 zhang zhongzhi
  • 6 篇 uno yushi
  • 5 篇 paul s.
  • 5 篇 cui bin
  • 5 篇 kawahara jun
  • 5 篇 qin lu
  • 5 篇 chen lei
  • 5 篇 lin xuemin

语言

  • 458 篇 英文
  • 58 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
518 条 记 录,以下是291-300 订阅
排序:
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar graphs
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年 第2期E94D卷 211-219页
作者: Zhuang, Bingbing Nagamochi, Hiroshi Kyoto Univ Dept Appl Math & Phys Grad Sch Informat Kyoto 6068501 Japan
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerp... 详细信息
来源: 评论
Computing a minimum cut in a graph with dynamic edges incident to a designated vertex
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2007年 第2期E90D卷 428-431页
作者: Nagamochi, Hiroshi Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
We consider an edge-weighted graph G with a designated vertex v(0) such that weights of edges incident to v(0) may increase or decrease. We show that, with an O(mn + n(2) log n) time preprocessing, a minimum cut of th... 详细信息
来源: 评论
On acyclic edge coloring of toroidal graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第13期111卷 647-649页
作者: Xu, Yian Nanjing Normal Univ Sch Math Sci Nanjing 210046 Peoples R China
Let c be a proper edge coloring of a graph G. If there exists no bicolored cycle in G with respect to c, then c is called an acyclic edge coloring of G. Let G be a planar graph with maximum degree Delta and girth g. I... 详细信息
来源: 评论
Finding bipartite subgraphs efficiently
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第5期110卷 174-177页
作者: Mubayi, Dhruv Turan, Gyoergy Univ Illinois Dept Math Stat & Comp Sci Chicago IL 60607 USA Univ Szeged Hungarian Acad Sci Res Grp Artificial Intelligence Szeged Hungary
Polynomial algorithms are given for the following two problems: given a graph with n vertices and m edges, find a complete balanced bipartite subgraph K(q,q) with q = right perpendicularln n/ln(2en(2)/m)left perpendic... 详细信息
来源: 评论
Topological Wiener Indices and Polynomials of C84 Fullerene Nanocage
收藏 引用
NANOSCIENCE AND NANOTECHNOLOGY LETTERS 2014年 第6期6卷 532-536页
作者: Khataee, Hamidreza Arefi-Oskoui, Samira Khataee, Alireza Liew, Alan Wee-Chung Griffith Univ Sch Informat & Commun Technol Gold Coast Campus Nathan Qld 4222 Australia Univ Tabriz Fac Chem Dept Appl Chem Res Lab Adv Water & Wastewater Treatment Proc Tabriz 516661647 Iran
The Wiener index is the most popular topological index used as an invariant molecular descriptor in the study of structures and physiochemical properties of molecules. Here, Wiener index and its modifications, hyper-W... 详细信息
来源: 评论
An algorithm for Motif-Based Network Design
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2017年 第5期14卷 1181-1186页
作者: Maki-Marttunen, Tuomo Tampere Univ Technol Dept Signal Proc Tampere 33720 Finland Univ Oslo Inst Clin Med N-0316 Oslo Norway
A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoti... 详细信息
来源: 评论
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期341卷 196-203页
作者: Gerbner, Daniel Keszegh, Balazs Lenger, Daniel Nagy, Daniel T. Palvolgyi, Domotor Patkos, Balazs Vizer, Mate Wiener, Gabor Alfred Reny Inst Math Budapest Hungary Eotvos Lorand Univ Budapest Hungary Budapest Univ Technol & Econ Dept Comp Sci & Informat Theory Budapest Hungary Alfred Reny Inst Math POB 127 H-1364 Budapest Hungary
We study exak(n, F), the largest number of edges in an n-vertex graph that contains exactly k copies of a given subgraph F. The case k = 0 is the Turan number ex(n, F) that is among the most studied parameters in extr... 详细信息
来源: 评论
On reconfigurability of target sets
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 942卷 253-275页
作者: Ohsaka, Naoto CyberAgent Inc Tokyo Japan
We study the problem of deciding reconfigurability of target sets of a graph. Given a graph G with vertex thresholds tau, consider a dynamic process in which vertex v becomes activated once at least tau(v) of its neig... 详细信息
来源: 评论
Matching Cut in graphs with Large Minimum Degree
收藏 引用
algorithmICA 2021年 第5期83卷 1238-1255页
作者: Chen, Chi-Yeh Hsieh, Sun-Yuan Le, Hoang-Oanh Le, Van Bang Peng, Sheng-Lung Natl Cheng Kung Univ Dept Comp Sci & Informat Engn 1Univ Rd Tainan 70101 Taiwan Univ Rostock Inst Informat Rostock Germany Natl Taipei Univ Business Dept Creat Technol & Prod Design Taipei Taiwan
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. While Matching Cut is trivial fo... 详细信息
来源: 评论
Network-Based Interpretation of Genomic Variation Data
收藏 引用
JOURNAL OF MOLECULAR BIOLOGY 2013年 第21期425卷 3964-3969页
作者: Halldorsson, Bjarni V. Sharan, Roded Reykjavik Univ IS-101 Reykjavik Iceland Tel Aviv Univ IL-69978 Tel Aviv Israel
Advances in sequencing technologies are allowing genome-wide association studies at an ever-growing scale. The interpretation of these studies requires dealing with statistical and combinatorial challenges, owing to t... 详细信息
来源: 评论