咨询与建议

限定检索结果

文献类型

  • 7 篇 期刊文献
  • 6 篇 会议

馆藏范围

  • 13 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 3 篇 电气工程
    • 2 篇 软件工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
  • 2 篇 理学
    • 1 篇 数学
    • 1 篇 化学
    • 1 篇 生物学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 1 篇 公共管理

主题

  • 13 篇 bron-kerbosch al...
  • 3 篇 graph theory
  • 2 篇 d-degenerate gra...
  • 2 篇 social network
  • 2 篇 sparse graphs
  • 1 篇 internet of thin...
  • 1 篇 exact algorithm
  • 1 篇 scalability
  • 1 篇 device-to-device...
  • 1 篇 np-hard
  • 1 篇 social network a...
  • 1 篇 maximal clique l...
  • 1 篇 compute nodes
  • 1 篇 performance opti...
  • 1 篇 radio resource a...
  • 1 篇 collaboration gr...
  • 1 篇 membrane computi...
  • 1 篇 maximal common s...
  • 1 篇 comorbidity grap...
  • 1 篇 low-level featur...

机构

  • 2 篇 univ calif irvin...
  • 1 篇 oklahoma state u...
  • 1 篇 east china univ ...
  • 1 篇 inonu univ dept ...
  • 1 篇 univ west london...
  • 1 篇 kyushu inst tech...
  • 1 篇 gdansk univ tech...
  • 1 篇 state univ new y...
  • 1 篇 prince sultan un...
  • 1 篇 univ sheffield d...
  • 1 篇 auburn univ dept...
  • 1 篇 gdansk univ tech...
  • 1 篇 huazhong univ sc...
  • 1 篇 natl ilan univ y...
  • 1 篇 walter friedrich...
  • 1 篇 jacksonville sta...
  • 1 篇 gdansk univ tech...
  • 1 篇 univ sheffield k...
  • 1 篇 univ elect sci &...
  • 1 篇 nagoya inst tech...

作者

  • 2 篇 eppstein david
  • 2 篇 strash darren
  • 1 篇 yadav rishu
  • 1 篇 miao zhuqi
  • 1 篇 karci ali
  • 1 篇 shih jyun-yao
  • 1 篇 tseng chih-cheng
  • 1 篇 fujiwara akihiro
  • 1 篇 kalgotra pankush
  • 1 篇 koch i
  • 1 篇 zhou yangming
  • 1 篇 bhatia ansh
  • 1 篇 lu yajun
  • 1 篇 xiong bowen
  • 1 篇 sharda ramesh
  • 1 篇 gupta prakhar
  • 1 篇 artymiuk pj
  • 1 篇 gardiner ej
  • 1 篇 mohebbi parisa v...
  • 1 篇 marciniuk karoli...

语言

  • 13 篇 英文
检索条件"主题词=Bron-Kerbosch algorithm"
13 条 记 录,以下是11-20 订阅
排序:
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal...
收藏 引用
21st Annual International Symposium on algorithms and Computations (ISAAC)
作者: Eppstein, David Loeffler, Maarten Strash, Darren Univ Calif Irvine Dept Comp Sci Irvine CA 92717 USA
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for en... 详细信息
来源: 评论
Listing All Maximal Cliques in Large Sparse Real-World Graphs
收藏 引用
10th International Symposium on Experimental algorithms
作者: Eppstein, David Strash, Darren Univ Calif Irvine Dept Comp Sci Irvine CA 92717 USA
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Loffler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. Our analysis shows th... 详细信息
来源: 评论
Centralized Graph based TSCH Scheduling for IoT Network Applications  19
Centralized Graph based TSCH Scheduling for IoT Network Appl...
收藏 引用
19th IEEE International Symposium on Parallel and Distributed Processing with Applications (IEEE ISPA)
作者: Choudhury, Nikumani Nasralla, Moustafa M. Gupta, Prakhar Rehman, Ikram Ur Birla Inst Technol & Sci Dept Comp Sci & Informat Syst Hyderabad India Prince Sultan Univ Dept Commun & Networks Engn Riyadh Saudi Arabia Univ West London Sch Comp & Engn London W5 5RF England
The current specification of the IEEE 802.15.4 standard supports several application specific Quality of Service (QoS) requirements for Internet of Things (IoT) network applications. Specifically, the Time Slotted Cha... 详细信息
来源: 评论