咨询与建议

限定检索结果

文献类型

  • 67 篇 期刊文献
  • 13 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 58 篇 工学
    • 48 篇 计算机科学与技术...
    • 11 篇 电气工程
    • 7 篇 软件工程
    • 6 篇 生物工程
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 控制科学与工程
    • 1 篇 测绘科学与技术
  • 45 篇 理学
    • 37 篇 数学
    • 7 篇 生物学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 13 篇 管理学
    • 12 篇 管理科学与工程(可...
    • 5 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 6 篇 医学
    • 3 篇 临床医学
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 艺术学
    • 1 篇 美术学

主题

  • 81 篇 linear time algo...
  • 6 篇 computational co...
  • 5 篇 domination
  • 3 篇 efficient edge d...
  • 3 篇 graph algorithms
  • 3 篇 polynomial time ...
  • 3 篇 secure dominatio...
  • 3 篇 np-complete
  • 3 篇 total domination
  • 3 篇 dominating induc...
  • 2 篇 approximation al...
  • 2 篇 surface
  • 2 篇 bipartite graph
  • 2 篇 planar graph
  • 2 篇 robust algorithm
  • 2 篇 chordal graphs
  • 2 篇 threshold graph
  • 2 篇 image processing
  • 2 篇 block graphs
  • 2 篇 line graph

机构

  • 4 篇 univ rostock ins...
  • 3 篇 santa fe inst 13...
  • 3 篇 max planck inst ...
  • 3 篇 univ leipzig com...
  • 2 篇 univ primorska u...
  • 2 篇 res org informat...
  • 2 篇 univ primorska u...
  • 2 篇 zhejiang univ de...
  • 2 篇 acad sinica inst...
  • 2 篇 univ leipzig int...
  • 2 篇 gunma univ grad ...
  • 2 篇 qufu normal univ...
  • 2 篇 univ vienna inst...
  • 1 篇 chongqing univ k...
  • 1 篇 univ libre bruxe...
  • 1 篇 indian inst tech...
  • 1 篇 univ limoges xli...
  • 1 篇 ctr noncoding rn...
  • 1 篇 itpi der math. f...
  • 1 篇 inst nacl metrol...

作者

  • 5 篇 kawarabayashi ke...
  • 4 篇 brandstaedt andr...
  • 3 篇 stadler peter f.
  • 3 篇 reed bruce
  • 3 篇 mosca raffaele
  • 3 篇 milanic martin
  • 3 篇 gaertner fabian
  • 2 篇 araki toru
  • 2 篇 li peng
  • 2 篇 liang zuosong
  • 2 篇 shang jianhui
  • 2 篇 schaudt oliver
  • 2 篇 mohar bojan
  • 2 篇 jha anupriya
  • 1 篇 steorts rebecca
  • 1 篇 hundt christian
  • 1 篇 miyazaki hiroka
  • 1 篇 duno erick
  • 1 篇 mccall eh
  • 1 篇 guillaume prevos...

语言

  • 72 篇 英文
  • 9 篇 其他
检索条件"主题词=linear time algorithm"
81 条 记 录,以下是41-50 订阅
WEIGHTED EFFICIENT DOMINATION FOR P5-FREE AND P6-FREE GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第4期30卷 2288-2303页
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Inst Informat D-18051 Rostock Germany Univ G DAnnunzio Dipartimento Econ I-65121 Pescara Italy
In a finite undirected graph G = (V, E), a vertex v is an element of V dominates itself and its neighbors in G. A vertex set D subset of V is an efficient dominating set (e.d.s. for short) of G if every v 2 V is domin... 详细信息
来源: 评论
Fast smoothing technique with edge preservation for single image dehazing
收藏 引用
IET COMPUTER VISION 2015年 第6期9卷 950-959页
作者: Wang, Dan Zhu, Jubo Natl Univ Def Technol Coll Sci Changsha Hunan Peoples R China
In the single-image dehazing problem, it is critical that the transmission is accurately estimated. However, the extracted transmission in the dark channel model cannot effectively deal with the edge and the sky area ... 详细信息
来源: 评论
On a class of graphs between threshold and total domishold graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 195卷 43-58页
作者: Chiarelli, Nina Milanic, Martin Univ Primorska Fac Math Nat Sci & Informat Technol Koper SI-6000 Slovenia Univ Primorska Andrej Marusic Inst SI-6000 Koper Slovenia
A total dominating set in a graph is a subset of vertices such that every vertex in the graph has a neighbor in it. A graph is said to be total domishold if it admits a total domishold structure, that is, a hyperplane... 详细信息
来源: 评论
Downhill domination problem in graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第6-8期115卷 580-581页
作者: Chen, Xue-gang Fujita, Shinya North China Elect Power Univ Dept Math Beijing 102206 Peoples R China Beijing Univ Technol Dept Appl Math Beijing 100124 Peoples R China Yokohama City Univ Int Coll Arts & Sci Yokohama Kanagawa 2360027 Japan
A path pi = (v(1), v(2), ... , v(k+1)) in a graph G = (V, E) is a downhill path if for every i, 1 = deg(v(i+1)), where deg(v(i)) denotes the degree of vertex v(i) is an element of V. A downhill dominating set DDS is a... 详细信息
来源: 评论
Dominating Induced Matchings for P7-Free Graphs in linear time
收藏 引用
algorithmICA 2014年 第4期68卷 998-1018页
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Fachbereich Informat D-18051 Rostock Germany Univ G DAnnunzio Dipartimento Sci I-65121 Pescara Italy
Let G be a finite undirected graph with edge set E. An edge set E'aS dagger E is an induced matching in G if the pairwise distance of the edges of E' in G is at least two;E' is dominating in G if every edg... 详细信息
来源: 评论
A characterization of line graphs that are squares of graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2014年 173卷 83-91页
作者: Milanic, Martin Oversberg, Andrea Schaudt, Oliver Univ Primorska UP IAM SI-6000 Koper Slovenia Univ Primorska UP FAMNIT SI-6000 Koper Slovenia Univ Cologne Inst Comp Sci D-50931 Cologne Germany Univ Paris 06 Inst Math Jussieu F-75252 Paris France
The square of a graph G, denoted by G(2), is the graph obtained from G by putting an edge between two distinct vertices whenever their distance in G is at most 2. Motwani and Sudan proved that it is NP-complete to dec... 详细信息
来源: 评论
Computing square roots of trivially perfect and threshold graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2013年 第10-11期161卷 1538-1545页
作者: Milanic, Martin Schaudt, Oliver Univ Primorska UP IAM SI-6000 Koper Slovenia Univ Primorska UP FAMNIT SI-6000 Koper Slovenia Univ Cologne Dept Comp Sci D-50931 Cologne Germany
A graph H is a square root of a graph G if two vertices are adjacent in G if and only if they are at distance one or two in H. Computing a square root of a given graph is NP-hard, even when the input graph is restrict... 详细信息
来源: 评论
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
收藏 引用
PATTERN RECOGNITION 2013年 第1期46卷 230-242页
作者: Wang, Jun Tan, Ying Peking Univ Sch Elect Engn & Comp Sci Dept Machine Intelligence Beijing 100871 Peoples R China Peking Univ Key Lab Machine Percept MOE Beijing 100871 Peoples R China State Adm Taxat Shandong Prov Off Jinan Peoples R China
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Euclidean distance transform (EDT) of a binary image in arbitrary dimensions. The PBEDT is based on independent scan and i... 详细信息
来源: 评论
A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width
A simpler linear time algorithm for embedding graphs into an...
收藏 引用
49th Annual Symposium on Foundations-of-Computer-Science
作者: Kawarabayashi, Ken-ichi Mohar, Bojan Reed, Bruce Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan Simon Fraser Univ G Theory CRC Dept Math Burnaby BC Canada McGill Univ G Theory CRC Montreal PQ Canada
For every fixed surface S, orientable or non-orientable, and a given graph G, Mohar (STOC'96 and Siam J. Discrete Math. (1999)) described a linear time algorithm which yields either an embedding of G in S or a min... 详细信息
来源: 评论
A Systematic algorithm for Identifying Faults on Hypercube-Like Networks Under the Comparison Model
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 2012年 第2期61卷 452-459页
作者: Lai, Pao-Lien Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Shoufeng 97401 Hualien Taiwan
There is a growing demand for fault diagnosis to increase the reliability of systems. Diagnosis by comparison is a realistic approach to the fault diagnosis of multiprocessor systems. In this paper, we consider n-dime... 详细信息
来源: 评论