咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 84 篇 理学
    • 80 篇 数学
    • 5 篇 生物学
    • 5 篇 统计学(可授理学、...
    • 2 篇 物理学
    • 2 篇 生态学
  • 70 篇 工学
    • 67 篇 计算机科学与技术...
    • 20 篇 软件工程
    • 12 篇 电气工程
    • 3 篇 控制科学与工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 生物医学工程(可授...
    • 1 篇 生物工程
  • 19 篇 管理学
    • 18 篇 管理科学与工程(可...
    • 2 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 农学
    • 1 篇 农业资源与环境
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 医学
    • 2 篇 临床医学

主题

  • 123 篇 linear-time algo...
  • 6 篇 approximation al...
  • 5 篇 tree
  • 4 篇 trees
  • 4 篇 obnoxious facili...
  • 4 篇 center problem
  • 4 篇 simple polygon
  • 4 篇 chordal graphs
  • 4 篇 location problem...
  • 4 篇 np-complete
  • 4 篇 np-completeness
  • 3 篇 stable matching ...
  • 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 篇 英文
  • 19 篇 其他
检索条件"主题词=Linear-time algorithm"
123 条 记 录,以下是111-120 订阅
排序:
A FORBIDDEN MINOR CHARACTERIZATION AND RELIABILITY OF A CLASS OF PARTIAL 4-TREES
收藏 引用
NETWORKS 1995年 第3期25卷 139-146页
作者: LINGNER, GT POLITOF, T SATYANARAYANA, A CONCORDIA UNIV MONTREALPQCANADA STEVENS INST TECHNOL HOBOKENNJ 07030
This paper characterizes a class G of partial 4-trees in terms of a set of seven forbidden miners. The class G contains several known classes of graphs, including both Delta - Y and Y - Delta graphs. A set of six grap... 详细信息
来源: 评论
COMPUTING MINIMAL SPANNING SUBGRAPHS IN linear-time
收藏 引用
SIAM JOURNAL ON COMPUTING 1995年 第6期24卷 1332-1358页
作者: HAN, XF KELSEN, P RAMACHANDRAN, V TARJAN, R MAX PLANCK INST INFORMAT D-66123 SAARBRUCKENGERMANY UNIV TEXAS DEPT COMP SCIAUSTINTX 78712 PRINCETON UNIV DEPT COMP SCIPRINCETONNJ 08544 NEC RES INST PRINCETONNJ 08540
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, find a minimal spanning subgraph of G with property P. We describe general algorithms for this problem ... 详细信息
来源: 评论
2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1993年 第3期70卷 391-404页
作者: SHAKHLEVICH, NV STRUSEVICH, VA ERASMUS UNIV ROTTERDAM POB 1738 3000 DR ROTTERDAM NETHERLANDS BYELORUSSIAN ACAD SCI INST ENGN CYBERNET MINSK 220012 BELARUS
The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are us... 详细信息
来源: 评论
A linear-time algorithm FOR SOLVING CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS
收藏 引用
OPERATIONS RESEARCH LETTERS 1991年 第1期10卷 23-26页
作者: KUNO, T KONNO, H ZEMEL, E TOKYO INST TECHNOL INST HUMAN & SOCIAL SCITOKYO 152JAPAN NORTHWESTERN UNIV JL KELLOGG GRAD SCH MANAGEMENTEVANSTONIL 60208
This paper introduces a special class of mathematical programming problem which maximizes the minimal value of a set of linear functions subject to a single linear constraint and upper bounding constraint on each vari... 详细信息
来源: 评论
A linear-time algorithm FOR FINDING APPROXIMATE SHORTEST COMMON SUPERSTRINGS
收藏 引用
algorithmICA 1990年 第3期5卷 313-323页
作者: UKKONEN, E 1. Department of Computer Science University of Helsinki Teollisuuskatu 23 SF-00510 Helsinki Finland
Approximate shortest common superstrings for a given setR of strings can be constructed by applying the greedy heuristics for finding a longest Hamiltonian path in the weighted graph that represents the pairwise overl... 详细信息
来源: 评论
MINIMIZING EXTERNAL WIRES IN GENERALIZED SINGLE-ROW ROUTING
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1992年 第6期41卷 771-776页
作者: BLAIR, JRS LLOYD, EL UNIV DELAWARE DEPT COMP SCINEWARKDE 19716
Much of the recent work on the automated design of VLSI chips has concentrated on routing problems associated with such designs. One major class of routing problems focuses on single-row routing. Recently, the traditi... 详细信息
来源: 评论
DETERMINISTIC DECOMPOSITION OF RECURSIVE GRAPH CLASSES
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1991年 第4期4卷 481-501页
作者: BORIE, RB PARKER, RG TOVEY, CA GEORGIA INST TECHNOL SCH IND & SYST ENGNATLANTAGA 30332
The Popular class of series-parallel graphs can be built recursively from single edges by combining smaller components via connections only at a fixed pair of vertices called terminals. This recursive construction pro... 详细信息
来源: 评论
SOME CHAIN VISIBILITY PROBLEMS IN A SIMPLE POLYGON
收藏 引用
algorithmICA 1990年 第4期5卷 485-507页
作者: LEE, SH CHWA, KY KOREA INST SCI & TECHNOL DEPT COMP SCI SEOUL 130650 SOUTH KOREA
In this paper, the notions of convex chain visibility and reflex chain visibility of a simple polygonP are introduced, and some optimal algorithms concerned with convex- and reflex-chain visibility problems are descri... 详细信息
来源: 评论
EMBEDDING RECTIlinear GRAPHS IN linear time
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第2期29卷 75-79页
作者: HOFFMANN, F KRIEGEL, K ACAD SCI GDR KARL WEIERSTRASS INST MATHDDR-1086 BERLINGER DEM REP
The class of rectilinear graphs, respectively embedded rectilinear graphs, was introduced by Budach (1978) and examined in the context of maze solving problems. These classes of graphs were independently redefined by... 详细信息
来源: 评论
A NEW TRIANGULATION-linear CLASS OF SIMPLE POLYGONS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1987年 第2期22卷 135-147页
作者: LEE, SH CHWA, KY EWHA WOMANS UNIV DEPT COMP SCISEODAEMUN KUSEOUL 120SOUTH KOREA
A new polygon class taking linear-time and space for triangulation, called an if-polygon, is defined. After describing an algorithm for triangulating this class, we show that some triangulation-linear classes previous... 详细信息
来源: 评论