检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

240 篇 期刊文献
203 篇 会议
2 册 图书

馆藏范围

445 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

321 篇 理学
- 302 篇 数学
- 29 篇 统计学（可授理学、...
- 22 篇 系统科学
- 19 篇 物理学
- 12 篇 生物学
- 3 篇 化学
- 3 篇 地球物理学
230 篇 工学
- 166 篇 计算机科学与技术...
- 109 篇 软件工程
- 39 篇 土木工程
- 36 篇 建筑学
- 23 篇 测绘科学与技术
- 18 篇 材料科学与工程（可...
- 17 篇 控制科学与工程
- 16 篇 信息与通信工程
- 12 篇 电子科学与技术（可...
- 8 篇 电气工程
- 7 篇 机械工程
- 7 篇 生物工程
- 4 篇 光学工程
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 3 篇 交通运输工程
53 篇 管理学
- 29 篇 图书情报与档案管...
- 25 篇 管理科学与工程(可...
- 11 篇 工商管理
7 篇 农学
- 7 篇 作物学
6 篇 法学
- 6 篇 社会学
4 篇 经济学
- 4 篇 应用经济学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

27 篇 parameterization
21 篇 graph theory
18 篇 approximation al...
17 篇 polynomial appro...
15 篇 graphic methods
13 篇 trees (mathemati...
11 篇 visualization
11 篇 parameter estima...
10 篇 computational co...
10 篇 algorithm design...
10 篇 directed graphs
9 篇 optimization
9 篇 clustering algor...
8 篇 drawing (graphic...
8 篇 hamiltonians
7 篇 evolutionary alg...
7 篇 constraint satis...
7 篇 evolutionary com...
6 篇 runtime
6 篇 integer programm...

机构

227 篇 algorithms and c...
18 篇 hamburg universi...
17 篇 department of in...
16 篇 department of co...
13 篇 algorithms and c...
9 篇 indian institute...
8 篇 school of comput...
8 篇 hamburg universi...
6 篇 algorithms and c...
6 篇 faculty of infor...
5 篇 school of comput...
5 篇 school of comput...
5 篇 department of in...
5 篇 cispa helmholtz ...
5 篇 department of ap...
5 篇 department of ma...
4 篇 university of le...
4 篇 department of en...
4 篇 department of al...
4 篇 department of en...

作者

85 篇 ganian robert
69 篇 nöllenburg marti...
47 篇 szeider stefan
31 篇 eiben eduard
31 篇 bhore sujoy
27 篇 mnich matthias
27 篇 ordyniak sebasti...
18 篇 simonov kirill
17 篇 hamm thekla
17 篇 klute fabian
16 篇 ramanujan m.s.
14 篇 kanj iyad
14 篇 wallinger markus
14 篇 montecchiani fab...
12 篇 golovach petr a.
12 篇 li guangping
12 篇 wulms jules
12 篇 fomin fedor v.
11 篇 neumann frank
11 篇 rutter ignaz

语言

424 篇 英文
20 篇 其他
1 篇 中文

检索条件"机构=Algorithms and Complexity"

共 445 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding 51

A Tight Subexponential-Time Algorithm for Two-Page Book Embe...

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Ganian, Robert Müller, Haiko Ordyniak, Sebastian Paesani, Giacomo Rychlicki, Mateusz Algorithms and Complexity Group TU Wien Austria School of Computing University of Leeds United Kingdom

ISBN: (纸本)9783959773225

A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into "pages", which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2 pages, are of special importance as they are both NP-hard to compute and have specific applications. We obtain a 2O(√n) algorithm for computing a book embedding of an n-vertex graph on two pages – a result which is asymptotically tight under the Exponential Time Hypothesis. As a key tool in our approach, we obtain a single-exponential fixed-parameter algorithm for the same problem when parameterized by the treewidth of the input graph. We conclude by establishing the fixed-parameter tractability of computing minimum-page book embeddings when parameterized by the feedback edge number, settling an open question arising from previous work on the problem. © Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Path-contractions, edge deletions and connectivity preservation 25

Path-contractions, edge deletions and connectivity preservat...

引用

25th European Symposium on algorithms, ESA 2017

作者： Gutin, Gregory Ramanujan, M.S. Reidl, Felix Wahlström, Magnus Algorithms and Complexity Group TU Wien Vienna Austria Royal Holloway University Egham United Kingdom

ISBN: (纸本)9783959770491

We study several problems related to graph modification problems under connectivity constraints from the perspective of parameterized complexity: (Weighted) Biconnectivity Deletion, where we are tasked with deleting k edges while preserving biconnectivity in an undirected graph, Vertexdeletion Preserving Strong Connectivity, where we want to maintain strong connectivity of a digraph while deleting exactly k vertices, and Path-contraction Preserving Strong Connectivity, in which the operation of path contraction on arcs is used instead. The parameterized tractability of this last problem was posed in [Bang-Jensen and Yeo, Discrete Applied Math 2008] as an open question and we answer it here in the negative: both variants of preserving strong connectivity are W[1]-hard. Preserving biconnectivity, on the other hand, turns out to be fixed parameter tractable (FPT) and we provide an FPT algorithm that solves Weighted Biconnectivity Deletion. Further, we show that the unweighted case even admits a randomized polynomial kernel. All our results provide further interesting data points for the systematic study of connectivitypreservation constraints in the parameterized setting.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

Parameterised Partially-Predrawn Crossing Number 38

Parameterised Partially-Predrawn Crossing Number

引用

38th International Symposium on Computational Geometry, SoCG 2022

作者： Hamm, Thekla Hlinený, Petr Algorithms and Complexity Group TU Wien Austria Faculty of Informatics Masaryk University Brno Czech Republic

ISBN: (纸本)9783959772273

Inspired by the increasingly popular research on extending partial graph drawings, we propose a new perspective on the traditional and arguably most important geometric graph parameter, the crossing number. Specifically, we define the partially predrawn crossing number to be the smallest number of crossings in any drawing of a graph, part of which is prescribed on the input (not counting the prescribed crossings). Our main result - an FPT-algorithm to compute the partially predrawn crossing number - combines advanced ideas from research on the classical crossing number and so called partial planarity in a very natural but intricate way. Not only do our techniques generalise the known FPT-algorithm by Grohe for computing the standard crossing number, they also allow us to substantially improve a number of recent parameterised results for various drawing extension problems. © Thekla Hamm and Petr Hlinn;licensed under Creative Commons License CC-BY 4.0

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Foundations of evolutionary multi-objective optimization 11

Foundations of evolutionary multi-objective optimization

引用

13th Annual Genetic and Evolutionary Computation Conference - Companion Publication, GECCO 2011 Companion

作者： Friedrich, Tobias Neumann, Frank Algorithms and Complexity Max Planck Institute for Informatics Germany School of Computer Science University of Adelaide Australia

来源：评论

学校读者我要写书评

暂无评论

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting 16

Discovering Archipelagos of Tractability for Constraint Sati...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Robert Ganian M. S. Ramanujan Stefan Szeider Algorithms and Complexity Group

ISBN: (纸本)9781510819672

The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of classes of instances for which CSP can be solved in polynomial time; such classes are often called "islands of tractability." A prominent way of defining islands of tractability for CSP is to restrict the relations that may occur in the constraints to a fixed set, called a constraint language, whereas a constraint language is conservative if it contains all unary relations. Schaefer's famous Dichotomy Theorem (STOC 1978) identifies all islands of tractability in terms of tractable constraint languages over a Boolean domain of values. Since then many extensions and generalizations of this result have been obtained. Recently, Bulatov (TOCL 2011, JACM 2013) gave a full characterization of all islands of tractability for CSP and the counting version #CSP that are defined in terms of conservative constraint languages. This paper addresses the general limit of the mentioned tractability results for CSP and #CSP, that they only apply to instances where all constraints belong to a single tractable language (in general, the union of two tractable languages isn't tractable). We show that we can overcome this limitation as long as we keep some control of how constraints over the various considered tractable languages interact with each other. For this purpose we utilize the notion of a strong backdoor of a CSP instance, as introduced by Williams et al. (IJCAI 2003), which is a set of variables that when instantiated moves the instance to an island of tractability, i.e., to a tractable class of instances. We consider strong backdoors into scattered classes, consisting of CSP instances where each connected component belongs entirely to some class from a list of tractable classes. Figuratively speaking, a scattered class constitutes an archipela

关键词： chip scale packaging communicating sequential processes phosphocellulose Language islands constraint satisfaction problems archipelagoes Constraint Polynomial time

来源：评论

学校读者我要写书评

暂无评论

Deterministic Constrained Multilinear Detection 48

Deterministic Constrained Multilinear Detection

引用

48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023

作者： Brand, Cornelius Korchemna, Viktoriia Skotnica, Michael Algorithms and Complexity Group TU Wien Austria Department of Applied Mathematics Charles University Prague Czech Republic

ISBN: (纸本)9783959772921

We extend the algebraic techniques of Brand and Pratt (ICALP’21) for deterministic detection of k-multilinear monomials in a given polynomial with non-negative coefficients to the more general situation of detecting colored k-multilinear monomials that satisfy additional constraints on the multiplicities of the colors appearing in them. Our techniques can be viewed as a characteristic-zero generalization of the algebraic tools developed by Guillemot and Sikora (MFCS’10) and Björklund, Kaski and Kowalik (STACS’13) As applications, we recover the state-of-the-art deterministic algorithms for the Graph Motif problem due to Pinter, Schachnai and Zehavi (MFCS’14), and give new deterministic algorithms for generalizations of certain questions on colored directed spanning trees or bipartite planar matchings running in deterministic time O∗(4k), studied originally by Gutin, Reidl, Wahlström and Zehavi (J. Comp. Sys. Sci. 95,’18). Finally, we give improved randomized algorithms for intersecting three and four matroids of rank k in characteristic zero, improving the record bounds of Brand and Pratt (ICALP’21) from O∗(64k) and O∗(256k), respectively, to O∗(4k). © Cornelius Brand, Viktoriia Korchemna, and Michael Skotnica

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Twin-Width Meets Feedback Edges and Vertex Integrity 19

Twin-Width Meets Feedback Edges and Vertex Integrity

引用

19th International Symposium on Parameterized and Exact Computation, IPEC 2024

作者： Balabán, Jakub Ganian, Robert Rocton, Mathis Faculty of Informatics Masaryk University Brno Czech Republic Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783959773539

The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding of this question is to consider the approximability of twin-width via fixed-parameter algorithms whose running time depends not on twin-width itself, but rather on parameters which impose stronger restrictions on the input graph. The first step that article made in this direction is to establish the fixed-parameter approximability of twin-width (with an additive error of 1) when the runtime parameter is the feedback edge number. Here, we make several new steps in this research direction and obtain: An asymptotically tight bound between twin-width and the feedback edge number;A significantly improved fixed-parameter approximation algorithm for twin-width under the same runtime parameter (i.e., the feedback edge number) which circumvents many of the technicalities of the original result and simultaneously avoids its formerly non-elementary runtime dependency;An entirely new fixed-parameter approximation algorithm for twin-width when the runtime parameter is the vertex integrity of the graph. © Jakub Balabán, Robert Ganian, and Mathis Rocton.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

On evolution-communication P systems with energy having bounded and unbounded communication 18th

On evolution-communication P systems with energy having boun...

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Juayong, Richelle Ann B. Hernandez, Nestine Hope S. Cabarle, Francis George C. Buño, Kelvin C. Adorna, Henry N. Algorithms and Complexity Lab Department of Computer Science University of the Philippines Diliman Diliman Quezon City1101 Philippines

ISBN: (纸本)9783319733586

We explore the computing power of Evolution-Communication P systems with energy (ECPe systems) considering dynamical communication measures, ComN, ComR and ComW. These measures consider the number of communication steps, communication rules and total energy used per communication step, respectively. In this paper, we address a previous conjecture that states that only semilinear sets can be generated with bounded ComX, X∈ { N, R, W}. Our result on bounded ComW seems to support such conjecture while the conjecture is not true for bounded ComN and ComR. We also show that the class of recursively enumerable sets can be computed using ECPe systems with two membranes. This improves a previous result that makes use of four membranes to show computational completeness. © 2018, Springer International Publishing AG.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

On Short Fastest Paths in Temporal Graphs 15th

On Short Fastest Paths in Temporal Graphs

引用

15th International Conference on algorithms and Computation, WALCOM 2021

作者： Danda, Umesh Sandeep Ramakrishna, G. Schmidt, Jens M. Srikanth, M. Indian Institute of Technology Tirupati Tirupati India Institute for Algorithms and Complexity TU Hamburg Hamburg Germany Hyderabad India

ISBN: (纸本)9783030682101

Temporal graphs equip their directed edges with a departure time and a duration, which allows to model a surprisingly high number of real-world problems. Recently, Wu et al. have shown that a fastest path in a temporal graph G from a given vertex s to a vertex z can be computed in near-linear time, where a fastest path is one that minimizes the arrival time at z minus the departure time at s. Here, we consider the natural problem of computing a fastest path from s to z that is in addition short, i.e. minimizes the sum of durations of its edges;this maximizes the total amount of spare time at stops during the journey. Using a new dominance relation on paths in combination with lexicographic orders on the departure and arrival times of these paths, we derive a near-linear time algorithm for this problem with running time O(n+ mlog p(G) ), where n: = | V(G) |, m: = | E(G) | and p(G) is upper bounded by both the maximum in-degree and the maximum edge duration of G. The dominance relation is interesting in its own right, and may be of use for several related problems like fastest paths with minimum fare, fastest paths with minimum number of stops, and other pareto-optimal path problems in temporal graphs. © 2021, Springer Nature Switzerland AG.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A SAT Attack on Rota’s Basis Conjecture 25

A SAT Attack on Rota’s Basis Conjecture

引用

25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022

作者： Kirchweger, Markus Scheucher, Manfred Szeider, Stefan Algorithms and Complexity Group TU Wien Austria Institut für Mathematik Technische Universität Berlin Germany

ISBN: (纸本)9783959772426

The SAT modulo Symmetries (SMS) is a recently introduced framework for dynamic symmetry breaking in SAT instances. It combines a CDCL SAT solver with an external lexicographic minimality checking algorithm. We extend SMS from graphs to matroids and use it to progress on Rota’s Basis Conjecture (1989), which states that one can always decompose a collection of r disjoint bases of a rank r matroid into r disjoint rainbow bases. Through SMS, we establish that the conjecture holds for all matroids of rank 4 and certain special cases of matroids of rank 5. Furthermore, we extend SMS with the facility to produce DRAT proofs. External tools can then be used to verify the validity of additional axioms produced by the lexicographic minimality check. As a byproduct, we have utilized our framework to enumerate matroids modulo isomorphism and to support the investigation of various other problems on matroids. © Markus Kirchweger, Manfred Scheucher, and Stefan Szeider.

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共45页 << < 6 7 8 9 10 11 12 13 14 15 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：