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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,094 篇 期刊文献
822 篇 会议
24 篇 学位论文
7 册 图书
1 篇 资讯

馆藏范围

2,947 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,331 篇 工学
- 2,087 篇 计算机科学与技术...
- 525 篇 软件工程
- 349 篇 电气工程
- 132 篇 测绘科学与技术
- 131 篇 土木工程
- 130 篇 信息与通信工程
- 130 篇 建筑学
- 79 篇 控制科学与工程
- 34 篇 电子科学与技术（可...
- 22 篇 网络空间安全
- 19 篇 生物工程
- 18 篇 材料科学与工程（可...
- 14 篇 交通运输工程
- 13 篇 仪器科学与技术
- 11 篇 化学工程与技术
- 11 篇 石油与天然气工程
- 11 篇 安全科学与工程
1,066 篇 理学
- 957 篇 数学
- 79 篇 统计学（可授理学、...
- 61 篇 生物学
- 51 篇 物理学
- 27 篇 化学
- 23 篇 系统科学
191 篇 管理学
- 142 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 38 篇 工商管理
36 篇 经济学
- 35 篇 应用经济学
33 篇 医学
- 16 篇 临床医学
- 11 篇 基础医学(可授医学...
19 篇 法学
- 14 篇 社会学
9 篇 教育学
8 篇 文学
6 篇 农学
1 篇 艺术学

主题

2,948 篇 graph algorithms
140 篇 approximation al...
106 篇 algorithms
96 篇 parallel algorit...
65 篇 computational co...
63 篇 graph theory
58 篇 parameterized co...
52 篇 combinatorial pr...
49 篇 analysis of algo...
46 篇 planar graphs
44 篇 shortest paths
44 篇 treewidth
39 篇 social networks
36 篇 data structures
36 篇 distributed comp...
33 篇 distributed algo...
30 篇 complexity
29 篇 parameterized al...
29 篇 np-completeness
26 篇 interval graphs

机构

24 篇 univ bergen dept...
19 篇 univ elect sci &...
16 篇 ben gurion univ ...
15 篇 ben gurion univ ...
12 篇 carnegie mellon ...
12 篇 stanford univ de...
10 篇 ist austria klos...
10 篇 carleton univ sc...
9 篇 univ vienna fac ...
9 篇 technion israel ...
9 篇 natl inst inform...
9 篇 carnegie mellon ...
9 篇 univ rostock ins...
8 篇 indian inst tech...
8 篇 simon fraser uni...
8 篇 chinese univ hon...
8 篇 swiss fed inst t...
8 篇 carnegie mellon ...
8 篇 tel aviv univ sc...
8 篇 national univers...

作者

31 篇 xiao mingyu
23 篇 tsur dekel
18 篇 saurabh saket
17 篇 panda b. s.
16 篇 fomin fedor v.
13 篇 bader david a.
13 篇 bodlaender hans ...
13 篇 pandey arti
13 篇 lokshtanov danie...
12 篇 kratsch dieter
11 篇 karthick t.
11 篇 de figueiredo ce...
11 篇 henzinger monika
11 篇 bodlaender hl
11 篇 nanongkai danupo...
10 篇 mcmillan scott
10 篇 dondi riccardo
10 篇 nagamochi hirosh...
10 篇 low tze meng
10 篇 dragan feodor f.

语言

2,328 篇 英文
612 篇 其他
8 篇 中文
2 篇 斯洛文尼亚文
1 篇 德文
1 篇 土耳其文

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

共 2948 条记录，以下是1791-1800 订阅

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

详细简洁

排序：

A Practical Algorithm for Embedding graphs on Torus 3

A Practical Algorithm for Embedding Graphs on Torus

引用

3rd International Symposium on Computing and Networking (CANDAR)

作者： Yu, Jiahua Gu, Qian-Ping Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9781467397971

Embedding graphs on the torus is a problem with both theoretical and practical importance. It is required to embed a graph on the torus for solving many application problems such as VLSI design, graph drawing and so on. Polynomial time and exponential time algorithms for embedding graphs on the torus are known. However, the polynomial time algorithms are very complex and their implementation has been a challenge for a long time. On the other hand, the implementations of some exponential time algorithms are known but they are not efficient for large graphs in practice. To develop an efficient practical tool for embedding graphs on the torus, we propose a new exponential time algorithm for embedding graphs on the torus. Compared with a well used previous exponential time algorithm, our algorithm has a better practical running time.

关键词： graph algorithms embedding graphs on surfaces torus computational study

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms for Balanced Spanning Tree Problem

Genetic Algorithms for Balanced Spanning Tree Problem

引用

3rd International Conference on Innovative Network Systems and Applications (iNetSApp) held in conjunction with Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Moharam, Riham Morsy, Ehab Ismail, Ismail A. Suez Canal Univ Dept Math Ismailia 41522 Egypt 6 October Univ Dept Comp Sci Cairo Egypt

ISBN: (纸本)9788360810668

Given an undirected weighted connected graph G = (V, E) with vertex set V and edge set E and a designated vertex r is an element of V, we consider the problem of constructing a spanning tree in G that balances both the minimum spanning tree and the shortest paths tree rooted at r. Formally, for any two constants a, alpha, beta >= 1, we consider the problem of computing an (alpha, beta)-balanced spanning tree T in G, in the sense that, (i) for every vertex v is an element of V, the distance between r and v in T is at most alpha times the shortest distance between the two vertices in G, and (ii) the total weight of T is at most beta times that of the minimum tree weight in G. It is well known that, for any alpha, beta >= 1, the problem of deciding whether G contains an (alpha, beta)-balanced spanning tree is NP-complete [ 15]. Consequently, given any alpha >= 1 (resp., beta >= 1), the problem of finding an (alpha, beta)-balanced spanning tree that minimizes beta (resp., alpha) is NP-complete. In this paper, we present efficient genetic algorithms for these problems. Our experimental results show that the proposed algorithm returns high quality balanced spanning trees.

关键词： Minimum Spanning Tree Shortest Paths Tree Balanced Spanning Tree Genetic algorithms graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Maximum Matching in Bounded Degree graphs 15

Distributed Maximum Matching in Bounded Degree Graphs

引用

16th International Conference on Distributed Computing and Networking

作者： Even, Guy Medina, Moti Ron, Dana Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel

ISBN: (纸本)9781450329286

We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least (1- epsilon) times the optimal in Delta(O(1/epsilon)) + O (1/epsilon(2))center dot log*(n) rounds where n is the number of vertices in the graph and Delta is the maximum degree. Our algorithm for the edge weighted case computes a matching whose weight is at least (1- epsilon) times the optimal in log(min{1/w(min),n/epsilon})(O(1/epsilon)) (Delta(O(1/epsilon))+log*(n)) rounds for edge-weights in [w(min), 1]. The best previous algorithms for both the unweighted case and the weighted case are by Lotker, Patt-Shamir, and Pettie (SPAA 2008). For the unweighted case they give a randomized (1- epsilon)-approximation algorithm that runs in O((log(n))/epsilon(3)) rounds. For the weighted case they give a randomized (1/2- epsilon)-approximation algorithm that runs in O(log(epsilon(-1)) center dot log(n)) rounds. Hence, our results improve on the previous ones when the parameters Delta, epsilon and w(min), are constants (where we reduce the number of runs from O(log(n)) to O(log*(n))), and more generally when Delta, 1/epsilon and 1/w(min) are sufficiently slowly increasing functions of n. Moreover, our algorithms are deterministic rather than randomized.

关键词： Centralized Local algorithms Distributed Local algorithms Maximum Matching Maximum Weighted Matching graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Spanning Edge Centrality: Large-scale Computation and Applications 15

Spanning Edge Centrality: Large-scale Computation and Applic...

引用

24th International Conference on World Wide Web (WWW)

作者： Mavroforakis, Charalampos Garcia-Lebron, Richard Koutis, Ioannis Terzi, Evimaria Boston Univ Boston MA 02215 USA Univ Texas San Antonio San Antonio TX USA Univ Puerto Rico Rio Piedras PR USA

ISBN: (纸本)9781450334693

The spanning centrality of an edge e in an undirected graph G is the fraction of the spanning trees of G that contain e. Despite its appealing definition and apparent value in certain applications in computational biology, spanning centrality hasn't so far received a wider attention as a measure of edge centrality. We may partially attribute this to the perceived complexity of computing it, which appears to be prohibitive for very large networks. Contrary to this intuition, spanning centrality can in fact be approximated arbitrary well by very efficient near-linear time algorithms due to Spielman and Srivastava, combined with progress in linear system solvers. In this article we bring theory into practice, with careful and optimized implementations that allow the fast computation of spanning centrality in very large graphs with millions of nodes. With this computational tool in our disposition, we demonstrate experimentally that spanning centrality is in fact a useful tool for the analysis of large networks. Specifically, we show that, relative to common centrality measures, spanning centrality is more effective in identifying edges whose removal causes a higher disruption in an information propagation procedure, while being very resilient to noise, in terms of both the edges scores and the resulting edge ranking.

关键词： edge centrality spanning trees graph algorithms social networks

来源：评论

学校读者我要写书评

暂无评论

Finding Subgraphs with Maximum Total Density and Limited Overlap 15

Finding Subgraphs with Maximum Total Density and Limited Ove...

引用

8th ACM International Conference on Web Search and Data Mining (WSDM)

作者： Balalau, Oana Denisa Bonchi, Francesco Chany, T-H. Hubert Gullo, Francesco Sozioz, Mauro CNRS Telecom Paristech Inst Mines Telecom Paris France Yahoo Labs Barcelona Spain Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781450333177

Finding dense subgraphs in large graphs is a key primitive in a variety of real-world application domains, encompassing social network analytics, event detection, biology, and finance. In most such applications, one typically aims at finding several (possibly overlapping) dense subgraphs which might correspond to communities in social networks or interesting events. While a large amount of work is devoted to finding a single densest subgraph, perhaps surprisingly, the problem of finding several dense subgraphs with limited overlap has not been studied in a principled way, to the best of our knowledge. In this work we define and study a natural generalization of the densest subgraph problem, where the main goal is to find at most k subgraphs with maximum total aggregate density, while satisfying an upper bound on the pairwise Jaccard coefficient between the sets of nodes of the subgraphs. After showing that such a problem is NP-Hard, we devise an efficient algorithm that comes with provable guarantees in some cases of interest, as well as, an efficient practical heuristic. Our extensive evaluation on large real-world graphs confirms the efficiency and effectiveness of our algorithms.

关键词： dense subgraph graph algorithms graph mining

来源：评论

学校读者我要写书评

暂无评论

Community Discovery Topology Construction for Ad Hoc Networks 8

Community Discovery Topology Construction for Ad Hoc Network...

引用

8th International Wireless Internet Conference (WICON)

作者： Drif, Ahlem Boukerram, Abdallah Slimani, Yacine Univ Setif 1 Dept Comp Sci Setif Algeria Univ Bejaia Dept Comp Sci Bejaia Algeria Univ Setif 1 Lab Intelligent Syst Setif Algeria

ISBN: (纸本)9783319188027;9783319188010

One of the most obvious features of ad hoc communication is the analyze of the relationships between the ad hoc network users and their need for communication. On that point, the determination of topologies for efficient broadcast based on property of users of ad hoc networks has attracted a growing interest. In the current work, we propose a method to build a virtual topology that exploits the property of community structure in ad hoc network. The first phase of the proposed method constructs a clustering tree based on structural weight of nodes, while maintaining capacity-efficient links. In the second phase, the algorithm determines a community backbone in order to ensure efficient transmission coverage. Results confirm the generation of a good topology.

关键词： graph algorithms Structural equivalence Topology algorithm Ad Hoc networks Discovering communities

来源：评论

学校读者我要写书评

暂无评论

Shortest-Path Queries in Planar graphs on GPU-Accelerated Architectures 10th

Shortest-Path Queries in Planar Graphs on GPU-Accelerated Ar...

引用

10th International Conference on Large-Scale Scientific Computations (LSSC)

作者： Chapuis, Guillaume Djidjev, Hristo Los Alamos Natl Lab POB 1663 Los Alamos NM 87545 USA

ISBN: (纸本)9783319265209;9783319265193

We develop an efficient parallel algorithm for answering shortest-path queries in planar graphs and implement it on a multi-node CPU-GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary vertices. For a planar graph with n vertices, that data structure needs O(n) storage per processor and allows queries to be answered in O(n(1/4)) time.

关键词： Shortest path problems graph algorithms Distributed computing GPU computing graph partitioning

来源：评论

学校读者我要写书评

暂无评论

The K-clique Densest Subgraph Problem 15

The K-clique Densest Subgraph Problem

引用

24th International Conference on World Wide Web (WWW)

作者： Tsourakakis, Charalampos E. Harvard Sch Engn & Appl Sci Cambridge MA 02138 USA

ISBN: (纸本)9781450334693

Numerous graph mining applications rely on detecting subgraphs which are large near-cliques. Since formulations that are geared towards finding large near-cliques are NP-hard and frequently inapproximable due to connections with the Maximum Clique problem, the poly-time solvable densest subgraph problem which maximizes the average degree over all possible subgraphs "lies at the core of large scale data mining"[10]. However, frequently the densest subgraph problem fails in detecting large near-cliques in networks. In this work, we introduce the k-clique densest subgraph problem, k >= 2. This generalizes the well studied densest subgraph problem which is obtained as a special case for k = 2. For k = 3 we obtain a novel formulation which we refer to as the triangle densest subgraph problem : given a graph G (V, E), find a subset of vertices S* such that tau (S*) = (max)(S subset of V) t (S)/vertical bar S vertical bar, where t (S) is the number of triangles induced by the set S. On the theory side, we prove that for any k constant, there exist an exact polynomial time algorithm for the k-clique densest subgraph problem. Furthermore, we propose an efficient 1/k-approximation algorithm which generalizes the greedy peeling algorithm of Asahiro and Charikar [8, 18] for k = 2. Finally, we show how to implement efficiently this peeling framework on MapReduce for any k >= 3, generalizing the work of Bahmani, Kumar and Vassilvitskii for the case k = 2 [10]. On the empirical side, our two main findings are that (i) the triangle densest subgraph is consistently closer to being a large near-clique compared to the densest subgraph and (ii) the peeling approximation algorithms for both k = 2 and k = 3 achieve on real-world networks approximation ratios closer to 1 rather than the pessimistic 1 k guarantee. An interesting consequence of our work is that triangle counting, a well-studied computational problem in the context of social network analysis can be used to detect large near-

关键词： Densest subgraph problem graph algorithms graph Mining Near-clique extraction

来源：评论

学校读者我要写书评

暂无评论

A Framework for Verifying Depth-First Search algorithms 15

A Framework for Verifying Depth-First Search Algorithms

引用

ACM SIGPLAN Conference on Certified Programs and Proofs (CPP)

作者： Lammich, Peter Neumann, Rene Tech Univ Munich Munich Germany

ISBN: (纸本)9781450332965

Many graph algorithms are based on depth-first search (DFS). The formalizations of such algorithms typically share many common ideas. In this paper, we summarize these ideas into a framework in Isabelle/HOL. Building on the Isabelle Refinement Framework, we provide support for a refinement based development of DFS based algorithms, from phrasing and proving correct the abstract algorithm, over choosing an adequate implementation style (e. g., recursive, tail-recursive), to creating an executable algorithm that uses efficient data structures. As a case study, we verify DFS based algorithms of different complexity, from a simple cyclicity checker, over a safety property model checker, to complex algorithms like nested DFS and Tarjan's SCC algorithm.

关键词： graph algorithms interactive theorem proving Isabelle/HOL refinement proof

来源：评论

学校读者我要写书评

暂无评论

Cooperative Computing for Autonomous Data Centers 29

Cooperative Computing for Autonomous Data Centers

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Berry, Jonathan Collins, Michael Kearns, Aaron Phillips, Cynthia A. Saia, Jared Smith, Randy Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Christopher Newport Univ Newport News VA 23606 USA

ISBN: (纸本)9781479986484

We present a new distributed model for graph computations motivated by limited information sharing. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph;2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have results for both models for s-t connectivity, one of the simplest graph problems that requires global information in the worst case. In the limited-sharing model, our results exploit social network structure. Standard communication complexity gives polynomial lower bounds on s-t connectivity for general graphs. However, if the graph for each data center has a giant component and these giant components intersect, then we can overcome this lower bound, computing s-t connectivity while exchanging O(log(2) n) bits for a constant number of data centers. We can also test the assumption that the giant components overlap using O(log(2) n) bits provided the (unknown) overlap is sufficiently large. The second result is in the low trust model. We give a secure multi-party computation (MPC) algorithm that 1) does not make cryptographic assumptions when there are 3 or more entities;and 2) is efficient, especially when compared to the usual garbled circuit approach. The entities learn only the yes/no answer. No party learns anything about the others' graph, not even node names. This algorithm does not require any special graph structure. This secure MPC result for s-t connectivity is one of the f

关键词： graph algorithms privacy s-t connectivity distributed computing models social networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共295页 << < 176 177 178 179 180 181 182 183 184 185 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：