咨询与建议

限定检索结果

文献类型

  • 107 篇 期刊文献
  • 15 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 84 篇 理学
    • 80 篇 数学
    • 5 篇 生物学
    • 5 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 生态学
  • 68 篇 工学
    • 65 篇 计算机科学与技术...
    • 21 篇 软件工程
    • 9 篇 电气工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 控制科学与工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 19 篇 管理学
    • 19 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 农学
  • 2 篇 医学
    • 2 篇 临床医学

主题

  • 122 篇 linear-time algo...
  • 6 篇 approximation al...
  • 5 篇 tree
  • 4 篇 trees
  • 4 篇 obnoxious facili...
  • 4 篇 center problem
  • 4 篇 chordal graphs
  • 4 篇 location problem...
  • 4 篇 np-complete
  • 4 篇 np-completeness
  • 3 篇 stable matching ...
  • 3 篇 simple polygon
  • 3 篇 pattern recognit...
  • 3 篇 diameter
  • 3 篇 labeling algorit...
  • 3 篇 steiner tree
  • 2 篇 program calculat...
  • 2 篇 connected compon...
  • 2 篇 computational co...
  • 2 篇 split graphs

机构

  • 3 篇 aichi prefectura...
  • 3 篇 univ rostock fac...
  • 2 篇 univ primorska f...
  • 2 篇 indian inst tech...
  • 2 篇 inst math phys &...
  • 2 篇 yamagata univ gr...
  • 2 篇 univ rostock fac...
  • 2 篇 univ glasgow dep...
  • 2 篇 inst math phys &...
  • 2 篇 univ paris sacla...
  • 2 篇 simon fraser uni...
  • 2 篇 hiroshima univ d...
  • 2 篇 shahed univ dept...
  • 2 篇 shanghai univ sc...
  • 2 篇 univ chicago div...
  • 2 篇 nagoya sangyo un...
  • 2 篇 univ modena & re...
  • 2 篇 indian inst tech...
  • 2 篇 univ maribor fac...
  • 2 篇 usi univ svizzer...

作者

  • 6 篇 dragan ff
  • 3 篇 he lifeng
  • 3 篇 suzuki kenji
  • 3 篇 rutter ignaz
  • 3 篇 chao yuyan
  • 3 篇 ogawa m
  • 2 篇 angelini patrizi...
  • 2 篇 frati fabrizio
  • 2 篇 lee sh
  • 2 篇 liang zuosong
  • 2 篇 yasuda muneki
  • 2 篇 inoue akihiko
  • 2 篇 bresar bostjan
  • 2 篇 irving robert w.
  • 2 篇 zmazek b
  • 2 篇 keshavarz-kohjer...
  • 2 篇 chwa ky
  • 2 篇 chaudhary juhi
  • 2 篇 goolsby eric w.
  • 2 篇 junginger kolja

语言

  • 102 篇 英文
  • 16 篇 其他
检索条件"主题词=Linear-time algorithm"
122 条 记 录,以下是31-40 订阅
排序:
On Topological Classification of Gradient-like Flows on an n-sphere in the Sense of Topological Conjugacy
收藏 引用
REGULAR & CHAOTIC DYNAMICS 2020年 第6期25卷 716-728页
作者: Kruglov, Vladislav E. Malyshev, Dmitry S. Pochinka, Olga V. Shubin, Danila D. Natl Res Univ Higher Sch Econ Ul Bolshaya Pecherskaya 25-12 Nizhnii Novgorod 603155 Russia
In this paper, we study gradient-like flows without heteroclinic intersections on an n-sphere up to topological conjugacy. We prove that such a flow is completely defined by a bicolor tree corresponding to a skeleton ... 详细信息
来源: 评论
Approximating Small Balanced Vertex Separators in Almost linear time
收藏 引用
algorithmICA 2019年 第10期81卷 4070-4097页
作者: Brandt, Sebastian Wattenhofer, Roger Swiss Fed Inst Technol Univ Str 6 CH-8092 Zurich Switzerland Swiss Fed Inst Technol Gloriastr 35 CH-8092 Zurich Switzerland
For a graph G with n vertices and m edges, we give a randomized Las Vegas algorithm that approximates a small balanced vertex separator of G in almost linear time. More precisely, we show the following, for any 2/3 &l... 详细信息
来源: 评论
Strong Cliques in Diamond-Free Graphs  46th
Strong Cliques in Diamond-Free Graphs
收藏 引用
46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
作者: Chiarelli, Nina Martinez-Barona, Berenice Milanic, Martin Monnot, Jerome Mursic, Peter Univ Primorska FAMNIT Koper Slovenia Univ Primorska IAM Koper Slovenia Univ Politecn Cataluna Dept Engn Civil & Ambiental Barcelona Spain Univ Paris 09 LAMSADE Paris 16 France
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs,... 详细信息
来源: 评论
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
收藏 引用
INFORMATION PROCESSING LETTERS 2020年 154卷
作者: Dragan, Feodor F. Kent State Univ Dept Comp Sci Algorithm Res Lab Kent OH 44242 USA
It is known that every chordal graph G = (V, E) has a spanning tree T such that, for every vertex v e V, eccG(v) < eccG(v) + 2 holds (here eccG(v) := max{dG(v, u) : u E V} is the eccentricity of v in G). We show th... 详细信息
来源: 评论
On f-domination: polyhedral and algorithmic results
收藏 引用
MATHEMATICAL METHODS OF OPERATIONS RESEARCH 2019年 第1期90卷 1-22页
作者: Dell'Amico, Mauro Neto, Jose Univ Modena & Reggio Emilia Dept Sci & Methods Engn Via Amendola 2 I-42122 Reggio Emilia Italy Univ Paris Saclay CNRS Telecom SudParis Samovar 9 Rue Charles Fourier F-91011 Evry France
Given an undirected simple graph G with node set V and edge set E, let f(v), for each node v is an element of V, denote a nonnegative integer value that is lower than or equal to the degree of v in G. An f -dominating... 详细信息
来源: 评论
On total f-domination: Polyhedral and algorithmic results
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 258卷 97-104页
作者: Dell'Amico, Mauro Neto, Jose Univ Modena & Reggio Emilia Dept Sci & Methods Engn Via Amendola 2 I-42122 Reggio Emilia Italy Univ Paris Saclay CNRS Telecom SudParis Samovar 9 Rue Charles Fourier F-91011 Evry France
Given a graph G = (V, E) and integer values f(v), v is an element of V, a node subset D subset of V is a total f -dominating set if every node v is an element of V is adjacent to at least f(v) nodes of D. Given a weig... 详细信息
来源: 评论
List-coloring clique-hypergraphs of K5-minor-free graphs strongly
收藏 引用
DISCRETE MATHEMATICS 2020年 第4期343卷
作者: Liang, Zuosong Wu, Jianliang Shan, Erfang Qufu Normal Univ Sch Management Rizhao 276800 Peoples R China Shandong Univ Dept Math Jinan 250100 Peoples R China Shanghai Univ Sch Management Shanghai 200444 Peoples R China
Let G be a connected simple graph with at least one edge. The hypergraph H = H(G) with the same vertex set as G whose hyper-edges are the maximal cliques of G is called the clique-hypergraph of G. A list-assignment of... 详细信息
来源: 评论
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees  1
收藏 引用
5th International Conference on 5th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Junginger, Kolja Mantas, Ioannis Papadopoulou, Evanthia USI Univ Svizzera Italiana Fac Informat Lugano Switzerland
We present a generalization of a combinatorial result from Aggarwal, Guibas, Saxe and Shor [1] on selecting a fraction of leaves, with pairwise disjoint neighborhoods, in a tree embedded in the plane. This result has ... 详细信息
来源: 评论
Closed-form expression for finite predictor coefficients of multivariate ARMA processes
收藏 引用
JOURNAL OF MULTIVARIATE ANALYSIS 2020年 176卷
作者: Inoue, Akihiko Hiroshima Univ Dept Math Higashihiroshima 7398526 Japan
We derive a closed-form expression for the finite predictor coefficients of multivariate ARMA (autoregressive moving-average) processes. The expression is given in terms of several explicit matrices that are of fixed ... 详细信息
来源: 评论
On minimum bisection and related cut problems in trees and tree-like graphs
收藏 引用
JOURNAL OF GRAPH THEORY 2018年 第2期89卷 214-245页
作者: Fernandes, Cristina G. Schmidt, Tina Janne Taraz, Anusch Univ Sao Paulo Inst Matemat & Estat Rua Matao 1010 BR-05508090 Sao Paulo Brazil TU Hamburg Inst Math Schwarzenberg Campus 3E D-21073 Hamburg Germany
Minimum bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two ... 详细信息
来源: 评论