Suchergebnisse - "Graph algorithm"

Graph-based design of irregular metamaterials von Karimi Mahabadi, Rayehe, Chen, Zhi, Ogren, Alexander C., Zhang, Han, Daraio, Chiara, Rudin, Cynthia, Brinson, L. Catherine

“… In the field of metamaterial research, irregular structures offer a novel and less conventional approach compared to traditional periodic designs. Designing …”
Volltext

Reconfiguring (non-spanning) arborescences von Ito, Takehiro, Iwamasa, Yuni, Kobayashi, Yasuaki, Nakahata, Yu, Otachi, Yota, Wasa, Kunihiro

“… In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem …”
Volltext

Graph burning: Tight bounds on the burning numbers of path forests and spiders von Tan, Ta Sheng, Teh, Wen Chean

“… •Discrete-time deterministic graph algorithm modelling the spread of social contagion.•Tight bounds on the burning numbers of spiders based on the number of …”
Volltext

Dispersion of mobile robots on graphs in the asynchronous model von Kshemkalyani, Ajay D.

“… The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k≤n, to coordinate with each other to reach a …”
Volltext

Efficient Graph-Based Image Segmentation von Felzenszwalb, Pedro F., Huttenlocher, Daniel P.

“… This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using …”
Volltext

Fabric defect detection via low-rank decomposition with gradient information and structured graph algorithm von Shi, Boshan, Liang, Jiuzhen, Di, Lan, Chen, Chen, Hou, Zhenjie

“… The low rank decomposition model shows the potential of fabric defect detection, in which a matrix is decomposed into a sparse matrix representing the defect …”
Volltext

Reconfiguration of cliques in a graph von Ito, Takehiro, Ono, Hirotaka, Otachi, Yota

“… We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into …”
Volltext

Research on the application of big data learning recommendation model driven by knowledge graph algorithm in educational information platform optimization von Zhang, Xiaowen

“… Driven by the global wave of digitalization, the education industry is undergoing profound changes, and the migration of traditional classroom teaching to …”
Volltext

From spatial to spectral: Network renormalization via dynamical correlations von Kim, Cook Hyun, Kahng, B.

“… Network renormalization has traditionally relied on spatial adjacency—grouping nearby nodes together—but this approach fails to capture the dynamical …”
Volltext

Efficient semi-external depth-first search von Wan, Xiaolong, Wang, Hongzhi

“… •A novel and efficient semi-external DFS algorithm EP-DFS is presented.•EP-DFS requires simpler CPU calculation and less memory space.•A novel index is devised …”
Volltext

Why blockchain needs graph: A survey on studies, scenarios, and solutions von Song, Jie, Zhang, Pengyi, Qu, Qiang, Bai, Yongjie, Gu, Yu, Yu, Ge

“… The popularity of blockchain platforms and their applications in industry and academia keeps rising. The multifarious requirements stimulate another technique, …”
Volltext

The perfect matching cut problem revisited von Le, Van Bang, Telle, Jan Arne

“… In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a …”
Volltext

text ^: Efficient Structural Graph Clustering on GPUs von Yuan, Long, Zhou, Zeyu, Chen, Zi, Lin, Xuemin, Zhao, Xiang, Zhang, Fan

“… Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the …”
Volltext

Happy Set Problem on Subclasses of Co-comparability Graphs von Eto, Hiroshi, Ito, Takehiro, Miyano, Eiji, Suzuki, Akira, Tamura, Yuma

Volltext

On the complexity of reconfiguration problems von Ito, Takehiro, Demaine, Erik D., Harvey, Nicholas J.A., Papadimitriou, Christos H., Sideri, Martha, Uehara, Ryuhei, Uno, Yushi

“… Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate …”
Volltext

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges von Zhou, Xiaotian, Zehmakan, Ahad N., Zhang, Zhongzhi

“… The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, …”
Volltext

The complexity of dominating set reconfiguration von Haddadan, Arash, Ito, Takehiro, Mouawad, Amer E., Nishimura, Naomi, Ono, Hirotaka, Suzuki, Akira, Tebbal, Youcef

“… Suppose that we are given two dominating sets Ds and Dt of a graph G whose cardinalities are at most a given threshold k. Then, we are asked whether there …”
Volltext

Sequentially Swapping Colored Tokens on Graphs von Yamanaka, Katsuhisa, Demaine, Erik, Horiyama, Takashi, Kawamura, Akitoshi, Nakano, Shin-ichi, Okamoto, Yoshio, Saitoh, Toshiki, Suzuki, Akira, Uehara, Ryuhei, Uno, Takeaki

“… We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting vertex and a set of allowable target …”
Volltext

Burnability of double spiders and path forests von Tan, Ta Sheng, Teh, Wen Chean

“… •Discrete-time deterministic graph algorithm modelling the spread of social contagion.•Tight bounds on the burning numbers of double spiders and path …”
Volltext

A fast projected fixed-point algorithm for large graph matching von Lu, Yao, Huang, Kaizhu, Liu, Cheng-Lin

“… We propose a fast algorithm for approximate matching of large graphs. Previous graph matching algorithms suffer from high computational complexity and …”
Volltext