咨询与建议

限定检索结果

文献类型

  • 40 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 43 篇 工学
    • 35 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 3 篇 生物工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 动力工程及工程热...
    • 2 篇 电气工程
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 控制科学与工程
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 船舶与海洋工程
    • 1 篇 航空宇航科学与技...
  • 31 篇 理学
    • 28 篇 数学
    • 4 篇 生物学
    • 2 篇 统计学(可授理学、...
  • 5 篇 管理学
    • 5 篇 管理科学与工程(可...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 57 篇 enumeration algo...
  • 5 篇 maximal cliques
  • 4 篇 polynomial delay
  • 3 篇 space efficiency
  • 3 篇 network mining a...
  • 2 篇 exact exponentia...
  • 2 篇 reverse search
  • 2 篇 query evaluation
  • 2 篇 dense subgraphs
  • 2 篇 community detect...
  • 2 篇 k-degenerate gra...
  • 2 篇 chain subgraph c...
  • 2 篇 combinatorial bo...
  • 2 篇 parameterized co...
  • 1 篇 triangle-free gr...
  • 1 篇 irredundant sets
  • 1 篇 genetic algorith...
  • 1 篇 f-fcsr-h v2
  • 1 篇 numerical algori...
  • 1 篇 monotone propert...

机构

  • 3 篇 natl inst inform...
  • 2 篇 lunghwa univ sci...
  • 2 篇 univ pisa pisa
  • 2 篇 natl taipei coll...
  • 2 篇 millennium inst ...
  • 2 篇 univ clermont au...
  • 2 篇 max planck inst ...
  • 2 篇 luiss univ rome
  • 2 篇 pontificia univ ...
  • 1 篇 samsung r&d ctr ...
  • 1 篇 univ lyon 1 univ...
  • 1 篇 univ norte barra...
  • 1 篇 politecn milan d...
  • 1 篇 univ toulouse in...
  • 1 篇 department of ci...
  • 1 篇 univ memphis dep...
  • 1 篇 btu cottbus senf...
  • 1 篇 univ firenze flo...
  • 1 篇 kyushu univ dept...
  • 1 篇 univ paris 06 eq...

作者

  • 5 篇 conte alessio
  • 5 篇 sinaimeri blerin...
  • 4 篇 sagot marie-fran...
  • 4 篇 marino andrea
  • 3 篇 nourine lhouari
  • 3 篇 uno takeaki
  • 3 篇 mary arnaud
  • 3 篇 grossi roberto
  • 3 篇 versari luca
  • 3 篇 calamoneri tizia...
  • 2 篇 elbassioni khale...
  • 2 篇 kante mamadou mo...
  • 2 篇 gastaldello matt...
  • 2 篇 yamanaka katsuhi...
  • 2 篇 wu ro-yu
  • 2 篇 rauf imran
  • 2 篇 wasa kunihiro
  • 2 篇 chang jou-ming
  • 2 篇 riveros cristian
  • 1 篇 soleimanfallah a...

语言

  • 48 篇 英文
  • 9 篇 其他
检索条件"主题词=Enumeration algorithms"
57 条 记 录,以下是31-40 订阅
排序:
On the number of minimal separators in graphs
收藏 引用
JOURNAL OF GRAPH THEORY 2018年 第4期87卷 653-659页
作者: Gaspers, Serge Mackenzie, Simon UNSW Sydney Sydney NSW Australia CSIRO Data61 Canberra ACT Australia Carnegie Mellon Univ Pittsburgh PA 15213 USA
Weconsider the largest number of minimal separators a graph on n vertices can have. - We give a new proof that this number is in O((1+root 5/2)(n).n). We prove that this number is in omega(1.4457(n)), improving on the... 详细信息
来源: 评论
Extended dualization: Application to maximal pattern mining
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 618卷 107-121页
作者: Nourine, Lhouari Petit, Jean-Marc Univ Blaise Pascal CNRS LIMOS Clermont Ferrand France Univ Lyon CNRS INSA Lyon LIRIS Lyon France
The dualization in arbitrary posets is a well-studied problem in combinatorial enumeration and is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of ... 详细信息
来源: 评论
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques  43
Sublinear-space bounded-delay enumeration for massive networ...
收藏 引用
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
作者: Conte, Alessio Grossi, Roberto Marino, Andrea Versari, Luca Dipartimento di Informatica Università di Pisa Pisa Italy Scuola Normale Superiore Pisa Italy
Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in ne... 详细信息
来源: 评论
On Maximal Chain Subgraphs and Covers of Bipartite Graphs  27th
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
收藏 引用
27th International Workshop on Combinatorial algorithms (IWOCA)
作者: Calamoneri, Tiziana Gastaldello, Mattia Mary, Arnaud Sagot, Marie-France Sinaimeri, Blerina Sapienza Univ Rome Via Salaria 113 I-00198 Rome Italy INRIA Villeurbanne France Univ Lyon 1 Univ Lyon LBBE CNRS UMR558 Villeurbanne France
In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm. We give bounds on the n... 详细信息
来源: 评论
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs
收藏 引用
algorithms FOR MOLECULAR BIOLOGY 2015年 第1期10卷 20-20页
作者: Sacomoto, Gustavo Lacroix, Vincent Sagot, Marie-France INRIA Rhone Alpes F-38330 Montbonnot St Martin France Univ Lyon F-69000 Lyon France Univ Lyon 1 F-69365 Lyon France CNRS Lab Biometrie & Biol Evolut UMR5558 F-69622 Villeurbanne France
Background: The problem of enumerating bubbles with length constraints in directed graphs arises in transcriptomics where the question is to identify all alternative splicing events present in a sample of mRNAs sequen... 详细信息
来源: 评论
Maximization of submodular functions: Theory and enumeration algorithms
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年 第1期198卷 102-112页
作者: Goldengorin, Boris Univ Groningen Dept Operat NL-9700 AV Groningen Netherlands
Submodular functions are powerful tools to model and solve either to optimality or approximately many operational research problems including problems defined on graphs. After reviewing some long-standing theoretical ... 详细信息
来源: 评论
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 487卷 82-94页
作者: Couturier, Jean-Francois Heggernes, Pinar van 't Hof, Pim Kratsch, Dieter Univ Lorraine LITA F-57045 Metz 01 France Univ Bergen Dept Informat N-5020 Bergen Norway
The number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159(n). This upper bound might not be tight, since no examples of graphs with 1.5705(n) or more minimal dominating se... 详细信息
来源: 评论
Optimization design of RFD set based on Genetic Algorithm
Optimization design of RFD set based on Genetic Algorithm
收藏 引用
2014 ISFMFE - 6th International Symposium on Fluid Machinery and Fluid Engineering
作者: Jiangyun Li Kai Guan Xiaofang Guo Wenwen Chen Zhichao Chen Department of Civil Engineering Wuhan University China China Nuclear Power Engineering Co. Ltd. Beijing China
RFD (Reverse flow divert) set is a kind of maintenance-free delivery system driving by compress-air. It intermittently discharges through its delivery pipe. Without moving part, the optimized design of RFD set is a cr... 详细信息
来源: 评论
An enumerative algorithm for solving nonconvex dynamic DEA models
收藏 引用
OPTIMIZATION LETTERS 2013年 第1期7卷 101-115页
作者: Soleimani-damaneh, M. Univ Tehran Coll Sci Sch Math Stat & Comp Sci Tehran Iran
This paper provides a recursive enumeration algorithm for solving the nonconvex dynamic DEA models, to obtain cost minimum under nonconvex technologies. The validity of the algorithm is proved through some theorems. A... 详细信息
来源: 评论
Parameterized top-K algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 470卷 105-119页
作者: Chen, Jianer Kanj, Iyad A. Meng, Jie Xia, Ge Zhang, Fenghui Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA Depaul Univ Sch Comp Chicago IL 60604 USA Samsung R&D Ctr San Jose CA 95134 USA Lafayette Coll Dept Comp Sci Easton PA 18042 USA Google Kirkland Kirkland WA 98033 USA
We study algorithmic techniques that produce the best K solutions to an instance of a parameterized NP-hard problem whose solutions are associated with a scoring function. Our parameterized top-K algorithms proceed in... 详细信息
来源: 评论