咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是341-350 订阅
排序:
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 905卷 54-68页
作者: Wang, Jiabing Chen, Jiaye South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China NetEase Inc Guangzhou 510665 Peoples R China
k-Clustering partitions a set of n points in a metric space into at most k clusters in a way that makes the resulted clusters satisfy both the homogeneity and the separation criteria. The diameter of a cluster is the ... 详细信息
来源: 评论
A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic graphs
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2022年 第7期34卷 3082-3094页
作者: Liu, Xuanming Ge, Tingjian Wu, Yinghui Univ Massachusetts Dept Comp Sci Lowell MA 01854 USA Case Western Reserve Univ Dept Comp & Data Sci Cleveland OH 44106 USA
One important problem that is insufficiently studied is finding densest lasting-subgraphs in large dynamic graphs, which considers the time duration of the subgraph pattern. We propose a framework called Expectation-M... 详细信息
来源: 评论
Faster deterministic algorithms for CO-PATH PACKING and CO-PATH/CYCLE PACKING
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第5期44卷 3701-3710页
作者: Tsur, Dekel Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
In the CO-PATH PACKING (resp., CO-PATH/CYCLE PACKING) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph wh... 详细信息
来源: 评论
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 )-free graphs
收藏 引用
JOURNAL OF graph THEORY 2022年 第3期99卷 435-460页
作者: Penev, Irena Charles Univ IUUK Comp Sci Inst Malostranske 25 Prague 11800 Czech Republic
We give a complete structural description of ( 4 K 1 , C 4 , C 6 , C 7 )-free graphs that do not contain a simplicial vertex, and we prove that such graphs have bounded clique-width. Together with the results of Foley... 详细信息
来源: 评论
Local Problems in Trees Across a Wide Range of Distributed Models  28
Local Problems in Trees Across a Wide Range of Distributed M...
收藏 引用
28th International Conference on Principles of Distributed Systems, OPODIS 2024
作者: Dhar, Anubhav Kujawa, Eli Lievonen, Henrik Modanese, Augusto Muftuoglu, Mikail Studený, Jan Suomela, Jukka Aalto University Espoo Finland Indian Institute of Technology Kharagpur India University of Illinois Urbana-ChampaignIL United States
The randomized online-LOCAL model captures a number of models of computing;it is at least as strong as all of these models: the classical LOCAL model of distributed graph algorithms, the quantum version of the LOCAL m... 详细信息
来源: 评论
Fast FPT algorithms for Grundy Number on Dense graphs  11th
Fast FPT Algorithms for Grundy Number on Dense Graphs
收藏 引用
11th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2025
作者: Ghasemi Nezhad, Sina Moghaddas, Maryam Panolan, Fahad Department of Mathematical Sciences Sharif University of Technology Tehran Iran School of Computer Science University of Leeds Leeds United Kingdom
In this paper, we investigate the Grundy Coloring problem for graphs with a cluster modulator, a structure commonly found in dense graphs. The Grundy chromatic number, representing the maximum number of colors needed ... 详细信息
来源: 评论
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds  51st
Efficient Top-k Frequent Subgraph Mining Using Tight Upper a...
收藏 引用
51st International Conference on Very Large Data Bases, VLDB 2025
作者: Lee, Seonho Lee, Yeunjun Park, Kunsoo Seoul National University Korea Republic of
Frequent sub graph mining is an important and well-studied problem with numerous applications such as the prediction of protein functionalities and graph indexing. Many studies use the minimum image-based support (MNI... 详细信息
来源: 评论
Parameterized Saga of First-Fit and Last-Fit Coloring  42
Parameterized Saga of First-Fit and Last-Fit Coloring
收藏 引用
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
作者: Agrawal, Akanksha Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Verma, Shaily Indian Institute of Technology Madras India University of California Santa BarbaraCA United States School of Computer Science University of Leeds United Kingdom The Institute of Mathematical Sciences HBNI Chennai India Department of Informatics University of Bergen Norway Algorithm Engineering Group Hasso Plattner Institute Potsdam Germany
The classic greedy coloring algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ord... 详细信息
来源: 评论
algorithms and Hardness Results for the (3, 1)-Cover Problem  11th
Algorithms and Hardness Results for the (3, 1)-Cover Pro...
收藏 引用
11th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2025
作者: Madani, Amirali Maheshwari, Anil Miraftab, Babak Roy, Bodhayan Carleton University OttawaON Canada IIT Kharagpur Kharagpur India
A connected graph has a (k,)-cover if each of its edges is contained in at least cliques of order k. Motivated by recent advances in extremal combinatorics and the literature on edge modification problems, we study th... 详细信息
来源: 评论
Fast FPGA Accelerator of graph Cut Algorithm with Threshold Global Relabel and Inertial Push
收藏 引用
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年
作者: Yan, Guangyao Liu, Xinzhe Wang, Hui Ha, Yajun ShanghaiTech University School of Information Science and Technology Shanghai201210 China University of Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering Beijing100049 China Chinese Academy of Sciences Shanghai Advanced Research Institute Shanghai201203 China Chinese Academy of Sciences Microelectronics The Shanghai Advanced Research Institute Shanghai201203 China Shanghai Engineering Research Center of Energy Efficient and Custom AI Integrated Circuits Shanghai201210 China
graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory resource utilization optimizatio... 详细信息
来源: 评论