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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,067 篇 期刊文献
820 篇 会议
41 篇 学位论文
7 册 图书
1 篇 资讯

馆藏范围

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

日期分布

学科分类号

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

主题

2,936 篇 graph algorithms
140 篇 approximation al...
106 篇 algorithms
94 篇 parallel algorit...
65 篇 computational co...
64 篇 graph theory
56 篇 parameterized co...
52 篇 combinatorial pr...
49 篇 analysis of algo...
45 篇 shortest paths
45 篇 planar graphs
44 篇 treewidth
39 篇 social networks
36 篇 data structures
36 篇 distributed comp...
33 篇 distributed algo...
29 篇 parameterized al...
29 篇 complexity
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 篇 brno university ...
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 篇 natl inst inform...
8 篇 tel aviv univ sc...

作者

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 篇 nagamochi hirosh...
10 篇 low tze meng
10 篇 dragan feodor f.
9 篇 dondi riccardo

语言

2,637 篇 英文
287 篇 其他
7 篇 中文
2 篇 斯洛文尼亚文
1 篇 德文
1 篇 土耳其文

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

共 2936 条记录，以下是311-320 订阅

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

详细简洁

排序：

Unified graph-based method for instance separation from foreground-background segmentation 57

Unified graph-based method for instance separation from fore...

引用

57th International Scientific Conference on Information, Communication and Energy Systems and Technologies (ICEST)

作者： Spasc, Milica Mihajlovc, Igor Spasc, Nikola Jankovc, Dragan Diffine LLC San Diego CA 92104 USA Univ NiS Fac Elect Engn Aleksandra Medvedeva 14 Nish 18000 Serbia

ISBN: (纸本)9781665485005

Instance segmentation problem is important for many computer vision applications. Recent state-of-the-art approaches use neural networks to predict per pixel foreground/background segmentation as well as other auxiliary data with subsequent methods for instance separation. All of these instance separation algorithms are very specific and require specific auxiliary data. Thus, we propose a unified graph-based method that can work with only foreground/background segmentation as well as with other auxiliary data structures.

关键词： Instance segmentation Computer vision graph algorithms Shortest path Blob detection

来源：评论

学校读者我要写书评

暂无评论

Low-Depth Spatial Tree algorithms 38

Low-Depth Spatial Tree Algorithms

引用

International Parallel and Distributed Processing Symposium (IPDPS)

作者： Baumann, Yves Ben-Nun, Tal Besta, Maciej Gianinazzi, Lukas Hoefler, Torsten Luczynski, Piotr Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9798350387117;9798350387124

Contemporary accelerator designs exhibit a high degree of spatial localization, wherein two-dimensional physical distance determines communication costs between processing elements. This situation presents considerable algorithmic challenges, particularly when managing sparse data, a pivotal component in progressing data science. The spatial computer model quantifies communication locality by weighting processor communication costs by distance, introducing a term named energy. Moreover, it integrates depth, a widely-utilized metric, to promote high parallelism. We propose and analyze a framework for efficient spatial tree algorithms within the spatial computer model. Our primary method constructs a spatial tree layout that optimizes the locality of the neighbors in the compute grid. This approach thereby enables locality-optimized messaging within the tree. Our layout achieves a polynomial factor improvement in energy compared to utilizing a PRAM approach. Using this layout, we develop energy-efficient treefix sum and lowest common ancestor algorithms, which are both fundamental building blocks for other graph algorithms. With high probability, our algorithms exhibit near-linear energy and poly-logarithmic depth. Our contributions augment a growing body of work demonstrating that computations can have both high spatial locality and low depth. Moreover, our work constitutes an advancement in the spatial layout of irregular and sparse computations.

关键词： graph algorithms Parallel algorithms Trees Routing and layout Distributed data structures Dataflow architectures Adaptable architectures

来源：评论

学校读者我要写书评

暂无评论

The MASEMPR Problem and Its Applications in Logistics 11th

The MASEMPR Problem and Its Applications in Logistics

引用

11th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2025

作者： Subramani, A. Subramani, K. Wojciechowski, Piotr Jena, Sangram K. Candorcare MorgantownWV United States LDCSEE West Virginia University MorgantownWV United States DCSSE Miami University OxfordOH United States

ISBN: (纸本)9783031834370

In this paper, we propose a new problem called the Maximum cardinality Acyclic Subset of Edges that Meets the Potential Requirements (MASEMPR). This problem abstracts several problems in logistics. Our focus is on a particular logistics problem called the Maximum Path Set (MPS) problem. We show that the MASEMPR problem is NP-hard. We then propose an exact exponential algorithm for the MASEMPR problem in subcubic graphs (graphs in which each vertex has degree at most 3). Finally, we design a constant factor approximation algorithm for the MASEMPR problem in general graphs. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Reachability in Temporal graphs Under Perturbation 50th

Reachability in Temporal Graphs Under Perturbation

引用

50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025

作者： Enright, Jessica Larios-Jones, Laura Meeks, Kitty Pettersson, William School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9783031826696

Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors in reporting, temporal graphs derived from data are unlikely to perfectly reflect reality, especially with respect to the precise times at which edges appear. To reflect this uncertainty, we consider a model in which some number ζ of edge appearances may have their labels perturbed by ±δ for some δ. Within this model, we investigate temporal reachability and consider the problem of determining the maximum number of vertices any vertex can reach under these perturbations. We show this problem to be intractable in general but efficiently solvable when ζ is sufficiently large. We also give algorithms which solve this problem in several restricted settings. We complement this with some contrasting results concerning the complexity of related temporal eccentricity problems under perturbation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Branching Random Walks and Their Applications 28

Distributed Branching Random Walks and Their Applications

引用

28th International Conference on Principles of Distributed Systems, OPODIS 2024

作者： Aradhya, Vijeth Gilbert, Seth Götte, Thorsten National University of Singapore Singapore University of Hamburg Germany

ISBN: (纸本)9783959773607

In recent years, the explosion of big data and analytics has necessitated distributed storage and processing with several compute nodes (e.g., multiple datacenters). These nodes collaboratively perform parallel computation, where the data is typically partitioned across these nodes to ensure scalability, redundancy and load-balancing. But the nodes may not always be co-located;in many cases, they are part of a larger communication network. Since those nodes only need to communicate among themselves, a key challenge is to design efficient routes catered to that subnetwork. In this work, we initiate the study of distributed sampling and routing problems for subnetworks in any well-connected network. Given any network G = (V,E) with mixing time τmix, consider the canonical problem of permutation routing [Ghaffari, Kuhn and Su, PODC 2017] that aims to minimize both congestion and dilation of the routes, where the demands (i.e., set of source-terminal pairs) are such that each node sends or receives number of messages proportional to its degree. We show that the permutation routing problem, when demands are restricted to any subset S ⊆ V (i.e., subnetwork), can be solved in exp(O(√log |S|)) · Õ(τmix) rounds (where Õ (·) hides polylogarithmic factors of |V |). This means that the running time depends subpolynomially on the subnetwork size (i.e., not on the entire network size). The ability to solve permutation routing efficiently immediately implies that a large class of parallel algorithms can be simulated efficiently on the subnetwork. As a prerequisite to constructing efficient routes, we design and analyze distributed branching random walks that distribute tokens started by the nodes in the subnetwork. At a high-level, these algorithms operate by always moving each token according to a (lazy) simple random walk, but also branching a token into multiple tokens at some specified intervals;ultimately, if a node starts a branching walk, with its id in a token, then by the

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Neighborhood Exploration for Dynamic Independent Sets∗

Optimal Neighborhood Exploration for Dynamic Independent Set...

引用

2025 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2025

作者： Borowitz, Jannick Großmann, Ernestine Schulz, Christian Heidelberg University Germany

ISBN: (纸本)9798331311995

A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and problem specific queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these algorithms have not been implemented or empirically evaluated. This work addresses the NP-complete maximum weight as well as the maximum cardinality independent set problem in a dynamic setting, applicable to areas like dynamic map-labeling and vehicle routing. In this work, specifically we introduce a novel local search technique called optimal neighborhood exploration. This technique creates independent subproblems that are solved to optimality, leading to improved overall solutions. Through numerous experiments, we assess the effectiveness of our approach and compare it with other state-of-the-art dynamic solvers. Our algorithm features a parameter, the subproblem size, that balances running time and solution quality. Copyright © 2025 by SIAM.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Approximating Densest Subgraph in Geometric Intersection graphs 42

Approximating Densest Subgraph in Geometric Intersection Gra...

引用

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025

作者： Har-Peled, Sariel Rahul, Saladi Department of Computer Science University of Illinois at Urbana-Champaign IL United States Bangalore India

ISBN: (纸本)9783959773652

For an undirected graph G = (V, E), with n vertices and m edges, the densest subgraph problem, is to compute a subset S ⊆ V which maximizes the ratio |ES|/|S|, where ES ⊆ E is the set of all edges of G with endpoints in S. The densest subgraph problem is a well studied problem in computer science. Existing exact and approximation algorithms for computing the densest subgraph require Ω(m) time. We present near-linear time (in n) approximation algorithms for the densest subgraph problem on implicit geometric intersection graphs, where the vertices are explicitly given but not the edges. As a concrete example, we consider n disks in the plane with arbitrary radii and present two different approximation algorithms. As a by-product, we show a reduction from (shallow) range-reporting to approximate counting/sampling which seems to be new and is useful for other problems such as independent query sampling. © Sariel Har-Peled and Saladi Rahul.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Simple Sublinear algorithms for (∆ + 1) Vertex Coloring via Asymmetric Palette Sparsification 8

Simple Sublinear Algorithms for (∆ + 1) Vertex Coloring via...

引用

8th SIAM Symposium on Simplicity of algorithms, SOSA 2025

作者： Assadi, Sepehr Yazdanyar, Helia Cheriton School of Computer Science University of Waterloo Canada

ISBN: (纸本)9781611978315

The palette sparsification theorem (PST) of Assadi, Chen, and Khanna (SODA 2019) states that in every graph G with maximum degree ∆, sampling a list of O(log n) colors from {1, ..., ∆ + 1} for every vertex independently and uniformly, with high probability, allows for finding a (∆ + 1) vertex coloring of G by coloring each vertex only from its sampled list. PST naturally leads to a host of sublinear algorithms for (∆ + 1) vertex coloring, including in semi-streaming, sublinear time, and MPC models, which are all proven to be nearly optimal, and in the case of the former two are the only known sublinear algorithms for this problem. While being a quite natural and simple-to-state theorem, PST suffers from two drawbacks. Firstly, all its known proofs require technical arguments that rely on sophisticated graph decompositions and probabilistic arguments. Secondly, finding the coloring of the graph from the sampled lists in an efficient manner requires a considerably complicated algorithm. We show that a natural weakening of PST addresses both these drawbacks while still leading to sublinear algorithms of similar quality (up to polylog factors). In particular, we prove an asymmetric palette sparsification theorem (APST) that allows for list sizes of the vertices to have different sizes and only bounds the average size of these lists. The benefit of this weaker requirement is that we can now easily show the graph can be (∆ + 1) colored from the sampled lists using the standard greedy coloring algorithm. This way, we can recover nearly-optimal bounds for (∆ + 1) vertex coloring in all the aforementioned models using algorithms that are much simpler to implement and analyze. Copyright © 2025 by SIAM.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Testing Dependency of Weighted Random graphs

Testing Dependency of Weighted Random Graphs

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Oren-Loberman, Mor Paslev, Vered Huleihel, Wasim Tel Aviv Univ Dept Elect Engn Syst IL-6997801 Tel Aviv Israel

ISBN: (纸本)9798350382853;9798350382846

In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically independent, while under the alternative, the edges of one graph are dependent on the edges of a randomly vertex-permuted version of the other graph. For general edge-weights distributions, we establish thresholds at which optimal testing is information-theoretically impossible and possible, as a function of the total number of nodes in the observed graphs and the generative distributions of the weights. Finally, we observe a statistical-computational gap in our problem, and we provide evidence that this is fundamental using the framework of low-degree polynomials.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Theory-to-Application Transition in Mathematics and Computer Science Studies

Theory-to-Application Transition in Mathematics and Computer...

引用

2024 Portland International Conference on Management of Engineering and Technology, PICMET 2024

作者： Kaku, Rikuei Asatani, Kimitaka Higashide, Noriyuki Sakata, Ichiro School of Engineering The University of Tokyo Tokyo Japan

ISBN: (纸本)9781890843458

Basic and applied research have been a pair of popular yet vaguely-defined concepts in scientific philosophy and technology management. This classification gets further challenged as once-theoretical studies like Artificial Intelligence became applicational in less than a decade. As such, a quantitative approach to evaluate the ongoing changes in and around computer science domain has both theoretical and practical implications. This study applies Topic-Aware Level Score, a science-of-science measure of application to mathematics and computer science domains and draws the following findings: On the theory side, methodological theories like graph algorithms and mathematical modeling are gaining application colors, but core and fundamental theories like equations and linear algebra remain steady as pure theories. On the application side, the most applied studies identified in this research have all been moving towards application in the past 3 decades, but some at a much faster pace than others. The study also identified neural networks as a representative case where the given study was completely theoretical in the 1990s but are now among the studies with highest application levels, making them potential showcases for technology incubation. This analysis of basic and applied research helps policymakers and research administrators to determine research directions and formulate funding strategies effectively. © 2024 PICMET.

关键词： graph algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共294页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：