咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 5 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 18 篇 工学
    • 18 篇 计算机科学与技术...
    • 4 篇 软件工程
    • 2 篇 电气工程
    • 1 篇 信息与通信工程
  • 17 篇 理学
    • 17 篇 数学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 28 篇 linear time algo...
  • 5 篇 graph algorithms
  • 2 篇 graphs
  • 2 篇 degree constrain...
  • 2 篇 isotonic regress...
  • 2 篇 multidimensional...
  • 1 篇 augmentation pro...
  • 1 篇 modular decompos...
  • 1 篇 p-4-free graphs
  • 1 篇 image processing...
  • 1 篇 string algorithm...
  • 1 篇 bipartite permut...
  • 1 篇 gauss-bonnett th...
  • 1 篇 directed tree
  • 1 篇 least squares re...
  • 1 篇 parallel process...
  • 1 篇 graph decomposit...
  • 1 篇 integer unimodal...
  • 1 篇 graph augmentati...
  • 1 篇 claw-free graphs

机构

  • 2 篇 hiroshima int un...
  • 2 篇 univ rostock fac...
  • 1 篇 univ montpellier...
  • 1 篇 univ paris dider...
  • 1 篇 tech univ claust...
  • 1 篇 cnr ist anal sis...
  • 1 篇 kyushu univ dept...
  • 1 篇 department of co...
  • 1 篇 inst informat po...
  • 1 篇 tel aviv univ sc...
  • 1 篇 univ quebec chic...
  • 1 篇 univ paris 07 cn...
  • 1 篇 wuhan univ state...
  • 1 篇 tech univ catalo...
  • 1 篇 emory univ dept ...
  • 1 篇 swiss fed inst t...
  • 1 篇 tech univ catolo...
  • 1 篇 kent state univ ...
  • 1 篇 tech univ dortmu...
  • 1 篇 jaist sch inform...

作者

  • 2 篇 taoka s
  • 2 篇 watanabe t
  • 2 篇 brandstädt a
  • 2 篇 valiente gabriel
  • 2 篇 blazewicz j
  • 1 篇 dellolmo p
  • 1 篇 pedersen max ris...
  • 1 篇 mosca r
  • 1 篇 razouk nader
  • 1 篇 mashima t
  • 1 篇 ecker k
  • 1 篇 xue g
  • 1 篇 takeda masayuki
  • 1 篇 quilliot alain
  • 1 篇 shapira asaf
  • 1 篇 tang j
  • 1 篇 rebaine djamal
  • 1 篇 köhler e
  • 1 篇 corneil derek
  • 1 篇 ubhaya vasant a.

语言

  • 26 篇 英文
  • 2 篇 其他
检索条件"主题词=Linear time algorithms"
28 条 记 录,以下是1-10 订阅
排序:
linear time algorithms TO SOLVE THE linear ORDERING PROBLEM FOR ORIENTED TREE BASED GRAPHS
收藏 引用
RAIRO-OPERATIONS RESEARCH 2016年 第2期50卷 315-325页
作者: Quilliot, Alain Rebaine, Djamal Univ Blaise Pascal LIMOS UMR CNRS 6158 BP 10125 Campus Cezeaux F-63173 Aubiere France Univ Quebec Chicoutimi Dept Math & Informat 555 Bld Univ Saguenay PQ Canada
We present in this paper two simple linear algorithms that solve to optimality the linear ordering problem for unweighted tree based graphs viz. the oriented trees and the oriented divide-and-conquer graphs.
来源: 评论
New Structures and algorithms for Length-Constrained Expander Decompositions  65
New Structures and Algorithms for Length-Constrained Expande...
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Haeupler, Bernhard Hershkowitz, D. Ellis Tan, Zihan Univ Sofia St Kliment Ohridski INSAIT Sofia Bulgaria Swiss Fed Inst Technol Zurich Switzerland Brown Univ Providence RI 02912 USA Rutgers State Univ New Brunswick NJ USA
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems w... 详细信息
来源: 评论
Counting Subgraphs in Degenerate Graphs
收藏 引用
JOURNAL OF THE ACM 2022年 第3期69卷 1–21页
作者: Bera, Suman K. Gishboliner, Lior Levanzov, Yevgeny Seshadhri, C. Shapira, Asaf Univ Calif Santa Cruz Santa Cruz CA 95060 USA Tel Aviv Univ Sch Math IL-69978 Tel Aviv Israel
We consider the problem of counting the number of copies of a fixed graph H within an input graph G. This is one of the most well-studied algorithmic graph problems, with many theoretical and practical applications. W... 详细信息
来源: 评论
New Advances in Rightmost Lempel-Ziv  1
收藏 引用
30th International Symposium on String Processing and Information Retrieval (SPIRE) / 18th Workshop on Compression, Text, and algorithms (WCTA)
作者: Ellert, Jonas Fischer, Johannes Pedersen, Max Rishoj Tech Univ Dortmund Dortmund Germany Tech Univ Denmark DTU Compute Lyngby Denmark
The Lempel-Ziv (LZ) 77 factorization of a string is a widely-used algorithmic tool that plays a central role in compression and indexing. For a length-n string over a linearly-sortable alphabet, e.g., Sigma = {1, . . ... 详细信息
来源: 评论
linear-time CUR approximation of BEM matrices
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2020年 368卷
作者: Ayala, Alan Claeys, Xavier Grigori, Laura Univ Paris Diderot SPC Sorbonne Univ INRIA Paris CNRSLab Jacques Louis LionsEquipe ALPINES Paris France Univ Paris Diderot SPC Sorbonne Univ CNRS INRIALab Jacques Louis LionsEquipe ALPINES F-75005 Paris France
In this paper we propose linear-time CUR approximation algorithms for admissible matrices obtained from the hierarchical form of Boundary Element matrices. We propose a new approach called geometric sampling to obtain... 详细信息
来源: 评论
A linear time algorithm for maximal clique enumeration in large sparse graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2017年 125卷 35-40页
作者: Yu, Ting Liu, Mengchi Wuhan Univ State Key Lab Software Engn Wuhan Hubei Peoples R China
A maximal clique is one of the most fundamental dense substructures in an undirected graph, and maximal clique enumeration (MCE) plays an essential role in densely connected subgraphs discovering. Existing algorithms ... 详细信息
来源: 评论
Palindrome pattern matching
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 483卷 162-170页
作者: Tomohiro, I Inenaga, Shunsuke Takeda, Masayuki Kyushu Univ Dept Informat Fukuoka 812 Japan
A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its ce... 详细信息
来源: 评论
Bijective linear time Coding and Decoding for k-Trees
收藏 引用
THEORY OF COMPUTING SYSTEMS 2010年 第2期46卷 284-300页
作者: Caminiti, Saverio Fusco, Emanuele G. Petreschi, Rossella Univ Roma La Sapienza Dept Comp Sci I-00198 Rome Italy
The problem of coding labeled trees has been widely studied in the literature and several bijective codes that realize associations between labeled trees and sequences of labels have been presented. k-trees are one of... 详细信息
来源: 评论
Digital topological method for computing genus and the Betti numbers
收藏 引用
TOPOLOGY AND ITS APPLICATIONS 2010年 第12期157卷 1931-1936页
作者: Chen, Li Rong, Yongwu George Washington Univ Washington DC 20052 USA
This paper concerns with computation of topological invariants such as genus and the Betti numbers. We design a linear time algorithm that determines such invariants for digital spaces in 3D. These computations could ... 详细信息
来源: 评论
An algebraic metric for phylogenetic trees
收藏 引用
APPLIED MATHEMATICS LETTERS 2009年 第9期22卷 1320-1324页
作者: Alberich, Ricardo Cardona, Gabriel Rossello, Francesc Valiente, Gabriel Univ Balearic Isl Dept Math & Comp Sci E-07122 Palma de Mallorca Spain Tech Univ Catolonia Dept Software E-08034 Barcelona Spain
The definition of similarity measures for phylogenetic trees has been motivated by the computation of consensus trees, the search by similarity in databases, and the assessment of phylogenetic reconstruction methods. ... 详细信息
来源: 评论