Suchergebnisse - Operations Research. Graph algorithms. Graph theory.

A decision support system for fraud detection in public procurement von Velasco, Rafael B., Carpanese, Igor, Interian, Ruben, Paulo Neto, Octávio C. G., Ribeiro, Celso C.

“… Over the past few years, investigators in Brazil have been uncovering numerous corruption and money laundering schemes at all levels of government and in the …”
Volltext

Spectral methods for graph clustering – A survey von Nascimento, Mariá C.V., de Carvalho, André C.P.L.F.

“… Due to its large applicability, several graph clustering algorithms have been proposed in the last years …”
Volltext

Efficient random graph matching via degree profiles von Ding, Jian, Ma, Zongming, Wu, Yihong, Xu, Jiaming

“… Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges …”
Volltext

Variations on memetic algorithms for graph coloring problems von Moalic, Laurent, Gondran, Alexandre

“… Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem …”
Volltext

Exact and approximation algorithms for covering timeline in temporal graphs von Dondi, Riccardo, Popa, Alexandru

“… We consider a variant of vertex cover on temporal graphs that has been recently defined for summarization of timeline activities in temporal graphs …”
Volltext

A study on k-walk generation algorithm to prevent the tottering in graph edit distance heuristic algorithms von Yoon, SeongCheol, Seo, Daehee, Kim, Su-Hyun, Lee, Im-Yeong

“… Many graph edit distance heuristic algorithms have been proposed to solve this problem …”
Volltext

Fast Approximate Quadratic Programming for Graph Matching von Vogelstein, Joshua T., Conroy, John M., Lyzinski, Vince, Podrazik, Louis J., Kratzer, Steven G., Harley, Eric T., Fishkind, Donniell E., Vogelstein, R. Jacob, Priebe, Carey E.

“… Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few …”
Volltext

Exact and approximation algorithms for routing a convoy through a graph: Exact and approximation algorithms for routing a convoy through a graph von van Ee, Martijn, Oosterwijk, Tim, Sitters, René, Wiese, Andreas

“… We study routing problems of a convoy in a graph, generalizing the shortest path problem (SPP …”
Volltext

Graph classification algorithm based on graph structure embedding von Ma, Tinghuai, Pan, Qian, Wang, Hongmei, Shao, Wenye, Tian, Yuan, Al-Nabhan, Najla

“… •Proposed a graph classification algorithm based on graph embedding. With the application of data mining in many fields such as information science, bioinformatic …”
Volltext

Conflict resolving – A local search algorithm for solving large scale conflict graphs in freight railway timetabling von Reisch, Julian, Großmann, Peter, Pöhle, Daniel, Kliewer, Natalia

“… •Slot construction on the microscopic infrastructure graph.•Heuristic column generation approach …”
Volltext

Visibility graph and graph convolution networks-based segmentation of carbon emission in China von Hu, Jun, Chu, Chengbin, Criado, Regino, Chen, Junhua, Hao, Shuya, Wang, Maoze

“… How to analyze the data is important. Furthermore, to find the main characteristics of carbon emission, we propose a new method of segmentation in the time series that adopts communities finding in complex network, graph convolution networks (GCN …”
Volltext

Simple Contrastive Graph Clustering von Liu, Yue, Yang, Xihong, Zhou, Sihang, Liu, Xinwang, Wang, Siwei, Liang, Ke, Tu, Wenxuan, Li, Liang

“… However, complicated data augmentations and time-consuming graph convolutional operations undermine the efficiency of these methods …”
Volltext

A Graph Adaptive Density Peaks Clustering algorithm for automatic centroid selection and effective aggregation von Xu, Tengfei, Jiang, Jianhua

“… selection and trigger domino effect. Therefore, a Graph Adaptive Density Peaks Clustering algorithm based on Graph Theory (called GADPC …”
Volltext

Transforming graph states using single-qubit operations von Dahlberg, Axel, Wehner, Stephanie

“… Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source …”
Weitere Angaben

Recommendation as link prediction in bipartite graphs: A graph kernel-based machine learning approach von Li, Xin, Chen, Hsinchun

“… By mapping transactions to a bipartite user–item interaction graph, a recommendation problem is converted into a link prediction problem, where the graph structure captures subtle information on relations between users and items …”
Volltext

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs von Şeker, Oylum, Ekim, Tınaz, Taşkın, Z. Caner

“… •The selective graph coloring problem in perfect graphs.•An exact cutting plane algorithm …”
Volltext

Efficient visibility algorithm for high-frequency time-series: application to fault diagnosis with graph convolutional network von Lee, Sangho, Choi, Jeongsub, Son, Youngdoo

“… To reflect the global structural information of a time series, many recent studies have used a graph constructed by visibility algorithms (VAs …”
Volltext

Approximation algorithms for the maximally balanced connected graph tripartition problem von Chen, Guangting, Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Liu, Tian, Zhang, An

“… Given a vertex-weighted connected graph G = ( V , E , w ( · ) ) , the maximally balanced connected graph k - partition ( k - BGP …”
Volltext

AND/OR graph generation for disassembly analysis: Deeply-nested subassemblies represented by a hypergraph von Iwase, S.

“… Manufacturers are demonstrating increased responsibility towards the environmental performance of their products throughout their life-cycles to promote a …”
Volltext

On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize: On the convergence result of the gradient-push algorithm on directed graphs von Choi, Woocheol, Kim, Doheon, Yun, Seok-Bae

“… Often, in applications, the graph of the agents is a directed graph. The gradient-push algorithm is a fundamental algorithm for distributed optimization when the agents are connected by a directed graph …”
Volltext