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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

362 篇 期刊文献
146 篇 会议
10 篇 学位论文

馆藏范围

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

日期分布

学科分类号

409 篇 工学
- 380 篇 计算机科学与技术...
- 94 篇 软件工程
- 64 篇 电气工程
- 24 篇 信息与通信工程
- 19 篇 电子科学与技术（可...
- 16 篇 控制科学与工程
- 6 篇 机械工程
- 4 篇 生物工程
- 3 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 1 篇 光学工程
212 篇 理学
- 190 篇 数学
- 13 篇 生物学
- 8 篇 统计学（可授理学、...
- 6 篇 物理学
- 5 篇 化学
- 5 篇 系统科学
- 1 篇 地球物理学
38 篇 管理学
- 35 篇 管理科学与工程(可...
- 12 篇 工商管理
- 4 篇 图书情报与档案管...
13 篇 经济学
- 13 篇 应用经济学
12 篇 医学
- 6 篇 临床医学
- 4 篇 基础医学(可授医学...
- 4 篇 特种医学
2 篇 文学
- 2 篇 新闻传播学
1 篇 哲学
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学
1 篇 农学

主题

518 篇 graph algorithm
51 篇 approximation al...
18 篇 np-complete
17 篇 domination
16 篇 tree
13 篇 computational co...
13 篇 combinatorial re...
12 篇 minimum spanning...
12 篇 shortest path
11 篇 chordal graph
11 篇 combinatorial op...
10 篇 gpu
9 篇 graph theory
9 篇 ordering
9 篇 parallel algorit...
9 篇 network optimiza...
8 篇 planar graph
8 篇 interval graphs
8 篇 reordering algor...
7 篇 apx-complete

机构

13 篇 tohoku univ grad...
10 篇 univ elect sci &...
7 篇 kyoto univ grad ...
6 篇 indian inst tech...
5 篇 indian inst tech...
5 篇 tohoku univ grad...
5 篇 univ rostock ins...
5 篇 indian inst tech...
5 篇 tohoku univ grad...
4 篇 univ sydney sch ...
4 篇 osaka prefecture...
4 篇 univ tokushima d...
4 篇 mit comp sci & a...
4 篇 otaru univ dept ...
4 篇 fudan univ sch c...
4 篇 univ bergen dept...
4 篇 univ helsinki de...
4 篇 shandong univ sc...
3 篇 georgia inst tec...
3 篇 tsinghua univ de...

作者

25 篇 ito takehiro
19 篇 nagamochi hirosh...
16 篇 panda b. s.
13 篇 ono hirotaka
10 篇 zhou xiao
10 篇 tarjan re
9 篇 pandey arti
9 篇 xiao mingyu
8 篇 ishii toshimasa
8 篇 otachi yota
7 篇 suzuki akira
7 篇 morsy ehab
7 篇 zhang zhongzhi
6 篇 uno yushi
5 篇 paul s.
5 篇 cui bin
5 篇 kawahara jun
5 篇 qin lu
5 篇 chen lei
5 篇 lin xuemin

语言

458 篇 英文
58 篇 其他
2 篇 中文

检索条件"主题词=Graph algorithm"

共 518 条记录，以下是431-440 订阅

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

详细简洁

排序：

Brief Announcement: Asynchronous Coordination with Constraints and Preferences 16

Brief Announcement: Asynchronous Coordination with Constrain...

引用

35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Castaneda, Armando Fraigniaud, Pierre Gafni, Eli Rajsbaum, Sergio Roy, Matthieu Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Paris Diderot CNRS IRIF Paris France Univ Calif Los Angeles CS Dept Los Angeles CA USA Univ Toulouse CNRS LAAS Toulouse France

ISBN: (纸本)9781450339643

Adaptive renaming can be viewed as a coordination task involving a set of asynchronous agents, each aiming at grabbing a single resource out of a set of resources totally ordered by their desirability. We consider a generalization of adaptive renaming to take into account scenarios in which resources are not independent. We model constraints between resources as an undirected graph: nodes represent the ressources, and an edge between two ressources indicates that these two ressources cannot be used simultaneously. In such a setting, the sets of resources that processes may use simultaneously form independent sets. In this note, we focus on this task in a model where such independent sets are computed by wait-free processes.

关键词： graph algorithm task wait-free computing coordination distributed algorithm renaming adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

The Fault-Tolerant Metric Dimension of Cographs 22nd

The Fault-Tolerant Metric Dimension of Cographs

引用

22nd International Symposium on Fundamentals of Computation Theory (FCT)

作者： Vietz, Duygu Wanke, Egon Heinrich Heine Univ Duesseldorf Univ Str 1 D-40225 Dusseldorf Germany

ISBN: (纸本)9783030250270;9783030250263

A vertex set U subset of V of an undirected graph G = (V, E) is a resolving set for G if for every two distinct vertices u, v is an element of V there is a vertex w is an element of U such that the distance between u and w and the distance between v and w are different. A resolving set U is fault tolerant if for every vertex u is an element of U set U \ {u} is still a resolving set. The (fault-tolerant) metric dimension of G is the size of a smallest (fault-tolerant) resolving set for G. The weighted (fault tolerant) metric dimension for a given cost function c : V -> R+ is the minimum weight of all (fault-tolerant) resolving sets. Deciding whether a given graph G has (fault-tolerant) metric dimension at most k for some integer k is known to be NP-complete. The weighted fault-tolerant metric dimension problem has not been studied extensively so far. In this paper we show that the weighted fault-tolerant metric dimension problem can be solved in linear time on cographs.

关键词： graph algorithm Complexity Metric dimension Fault-tolerant metric dimension Resolving set Cograph

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Spark/graphX on POWER8 Cluster

Performance Analysis of Spark/GraphX on POWER8 Cluster

引用

International Supercomputing Conference (ISC High Performance)

作者： Que, Xinyu Schneidenbach, Lars Checconi, Fabio Costa, Carlos H. A. Buono, Daniele IBM TJ Watson Yorktown Hts NY 10598 USA

ISBN: (纸本)9783319460796;9783319460789

POWER8, the latest RISC (Reduced Instruction Set Computer) microprocessor of the IBM Power architecture family, was designed to significantly benefit emerging workloads, including Business Analytics, Cloud Computing and High Performance Computing. In this paper, we provide a thorough performance evaluation on a widely used large-scale graph processing framework, Spark/graphX, on a POWER8 cluster. Note that we use Spark and Java versions out of the box without any optimization. We examine the performance with several important graph kernels such as Breadth-First Search, Connected Components, and PageRank using both large real-world social graphs and synthetic graphs of billions of edges. We study the Spark/graphX performance against some architectural aspects and perform the first Spark/graphX scalability test with up to 16 POWER8 nodes.

关键词： POWER8 Spark/graphX graph algorithm

来源：评论

学校读者我要写书评

暂无评论

AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing 25th

AOT: Pushing the Efficiency Boundary of Main-Memory Triangle...

引用

25th International Conference on Database Systems for Advanced Applications (DASFAA)

作者： Yu, Michael Qin, Lu Zhang, Ying Zhang, Wenjie Lin, Xuemin Univ New South Wales Kensington Australia Univ Technol Sydney Ultimo Australia

ISBN: (纸本)9783030594152;9783030594169

Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orientation framework, which can be thought of as mapping an undirected graph to a directed acylic graph, namely oriented graph, with respect to any global vertex order. In this paper, we propose an adaptive orientation technique that satisfies the orientation technique but refines it by traversing carefully based on the out-degree of the vertices in the oriented graph during the computation of triangles. Based on this adaptive orientation technique, we design a new algorithm, namely AOT, to enhance the edge-iterator listing paradigm. We also make improvements to the performance of AOT by exploiting the local order within the adjacent list of the vertices. We show that AOT is the first work which can achieve best performance in terms of both practical performance and theoretical time complexity. Our comprehensive experiments over 16 real-life large graphs show a superior performance of our AOT algorithm when compared against the state-of-the-art, especially for massive graphs with billions of edges. Theoretically, we show that our proposed algorithm has a time complexity of circle minus(Sigma(< u,v >is an element of E) min{deg(+) (u), deg(+) (v)})), where E and deg(+) (x) denote the set of directed edges in an oriented graph and the out-degree of vertex x respectively. As to our best knowledge, this is the best time complexity among in-memory triangle listing algorithms.

关键词： Triangle Enumeration graph algorithm

来源：评论

学校读者我要写书评

暂无评论

An Experimental Analysis of Heuristics for Profile Reduction 19th

An Experimental Analysis of Heuristics for Profile Reduction

引用

19th International Conference on Computational Science and Its Applications (ICCSA)

作者： Gonzaga de Oliveira, S. L. Osthoff, C. Henderson Guedes de Oliveira, L. N. Univ Fed Lavras Lavras MG Brazil Lab Nacl Comp Cient LNCC Petropolis RJ Brazil Univ Estado Rio de Janeiro Nova Friburgo RJ Brazil

ISBN: (纸本)9783030242893

This paper concentrates on low-cost heuristics for profile reduction. Low-cost methods for profile reduction are mainly heuristic in nature and based on graph-theoretic concepts. The contribution of this paper is twofold. Firstly, the paper includes a section involving a numerical examination of the current state-of-art metaheuristic and graph-theoretic methods for matrix profile reduction. With the support of extensive experiments, this paper shows that the metaheuristic-based algorithm is capable of reducing the profile of some matrices where the other algorithms do not perform well, but on average, the profile reduction obtained is similar for these algorithms, whereas the metaheuristicbased algorithm takes seven orders of magnitude more running time. These high execution times make the metaheuristic-based algorithm a noncontender for sparse matrix factorization and related problems. Secondly, this paper experimentally evaluates a hybrid algorithm based on the MPG and NSloan heuristics. This paper also evaluates the new hybrid heuristic for profile reduction when applied to matrices arising from two application areas against the most promising low-cost heuristics for solving the problem. The results obtained on a set of standard benchmark matrices show that the new hybrid heuristic method does not compare favorably with existing low-cost heuristics for profile reduction when applied to large-scale matrices.

关键词： Profile reduction Sparse matrices graph labelling Combinatorial optimization graph theory Search methods Reordering algorithms Renumbering Ordering graph algorithm Permutation of sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs 1

引用

Conference on Analysis of Experimental algorithms (SEA2)

作者： Kawahara, Jun Saitoh, Toshiki Suzuki, Hirofumi Yoshinaka, Ryo Nara Inst Sci & Technol Ikoma Japan Kyushu Inst Technol Iizuka Fukuoka Japan Hokkaido Univ Sapporo Hokkaido Japan Tohoku Univ Sendai Miyagi Japan

ISBN: (数字)9783030340292

ISBN: (纸本)9783030340292;9783030340285

This paper considers enumeration of specific subgraphs of a given graph by using a data structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the set of solutions quite compactly. Recent studies have demonstrated that a technique generically called frontier-based search (FBS) is a powerful framework for using ZDDs to enumerate various yet rather simple types of subgraphs. We in this paper, propose colorful FBS, an enhancement of FBS, which enables us to enumerate more complex types of subgraphs than existing FBS techniques do. On the basis of colorful FBS, we design methods that construct ZDDs representing the sets of chordal and interval subgraphs from an input graph. Computer experiments show that the proposed methods run faster than reverse search based algorithms.

关键词： graph algorithm graph enumeration Decision diagram Frontier-based search Interval graph Chordal graph

来源：评论

学校读者我要写书评

暂无评论

Bounding Stability in Formal Concept Analysis 1st

Bounding Stability in Formal Concept Analysis

引用

1st International Conference on Advanced Computational and Communication Paradigms (ICACCP)

作者： Bhuyan, Bikram P. Karmakar, Arindam Hazarika, Shyamanta M. Asian Inst Management & Technol Gauhati Assam India Tezpur Univ Biomimet & Cognit Robot Lab Comp Sci & Engn Tezpur Assam India Indian Inst Technol Guwahati Dept Mech Engn Gauhati India

ISBN: (纸本)9789811082375;9789811082368

In Formal Concept Analysis, stability is an important utility measure to rank concepts. However, computation of stability is considered to be a hard problem. Efficient algorithms having good bounds to estimate stability holds promise. In this paper, an effective graph-based technique is proposed to estimate stability. Our estimation algorithm has a polynomial time complexity of O(vertical bar A vertical bar(2)) where vertical bar A vertical bar is the number of vertices.

关键词： Formal concept analysis algorithms graph algorithm Estimation algorithm Combinatorial problem

来源：评论

学校读者我要写书评

暂无评论

Certifying Induced Subgraphs in Large graphs 17th

Certifying Induced Subgraphs in Large Graphs

引用

17th International Conference and Workshops on algorithms and Computation

作者： Meyer, Ulrich Tran, Hung Tsakalidis, Konstantinos Goethe Univ Frankfurt Frankfurt Germany Univ Liverpool Liverpool Merseyside England

ISBN: (纸本)9783031270505;9783031270512

We introduce I/O-effiient certifying algorithms for bipartite graphs, as well as for the classes of split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate that characterizes this class. Otherwise, it returns a forbidden induced subgraph as a certificate for non-membership. On a graph with n vertices and m edges, our algorithms take O(SORT(n + m)) I/Os in the worst case for split, threshold and trivially perfect graphs. In the same complexity bipartite and bipartite chain graphs can be certified with high probability. We provide implementations for split and threshold graphs and provide a preliminary experimental evaluation.

关键词： Certifying algorithm graph algorithm External memory

来源：评论

学校读者我要写书评

暂无评论

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm 12

Mutual-visibility in distance-hereditary graphs: a linear-ti...

引用

12th Latin-American algorithms, graphs and Optimization Symposium (LAGOS)

作者： Cicerone, Serafino Di Stefano, Gabriele Univ Aquila Dipartimento Ingn & Sci Informaz & Matemat I-67100 Laquila Italy

The concept of mutual-visibility in graphs has been recently introduced. If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u, v-path P such that V(P) boolean AND X subset of {u, v}. If every two vertices from X are X-visible, then X is a mutual-visibility set. The mutual-visibility number of G is the cardinality of a largest mutual-visibility set of G. It is known that computing the mutual-visibility number of a graph is NP-complete, whereas it has been shown that there are exact formulas for special graph classes like paths, cycles, blocks, cographs, and grids. In this paper, we study the mutual-visibility in distance-hereditary graphs and show that the mutual-visibility number can be computed in linear time for this class. (C) 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0)

关键词： Mutual visibility graph classes graph invariant graph algorithm Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Computing the Metric Dimension by Decomposing graphs into Extended Biconnected Components (Extended Abstract) 13th

Computing the Metric Dimension by Decomposing Graphs into Ex...

引用

13th International Conference on algorithms and Computation (WALCOM)

作者： Vietz, Duygu Hoffmann, Stefan Wanke, Egon Heinrich Heine Univ Duesseldorf Univ Str 1 D-40225 Dusseldorf Germany

ISBN: (纸本)9783030105648;9783030105631

A vertex set U C V of an undirected graph G = (V, E) is a resolving set for G, if for every two distinct vertices u, v E V there is a vertex w E U such that the distance between u and w and the distance between v and w are different. The Metric Dimension of G is the size of a smallest resolving set for G. Deciding whether a given graph G has Metric Dimension at most k for some integer k is well-known to be NP-complete. A lot of research has been done to understand the complexity of this problem on restricted graph classes. In this paper, we decompose a graph into its so called extended biconnected components and present an efficient algorithm for computing the metric dimension for a class of graphs having a minimum resolving set with a bounded number of vertices in every extended biconnected component. Furthermore, we show that the decision problem METRIC DIMENSION remains NP-complete when the above limitation is extended to usual biconnected components.

关键词： graph algorithm Complexity Metric dimension Resolving set Biconnected component

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：