Results 31 to 40 of about 206,716 (316)
CoRR, 2014 We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the structure of the whole graph and maybe added some randomness.
David Gamarnik +2 more
openaire +2 more sources
Summary of Large-Scale Grapb Partitioning Algoritbms
Dianxin kexue, 2014 The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were ...
Jinfeng Xu +4 more
doaj +2 more sources
Coloring Algorithms on Subcubic Graphs [PDF]
International Journal of Foundations of Computer Science, 2002 We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones.
San Skulrattanakulchai, Harold N. Gabow
openaire +1 more source
A simple algorithm for graph reconstruction
Random Structures & Algorithms, 2023 AbstractHow efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to find every edge in the graph. This problem admits a reconstruction algorithm based on multi‐phase Voronoi‐cell decomposition and using distance queries.
Mathieu, Claire, Zhou, Hang
openaire +5 more sources
Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms
, 2011 It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +4 more
core +1 more source
Graph colouring algorithms [PDF]
, 2015 This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.
openaire +2 more sources
FEBS Letters, EarlyView.An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
Compact routing on the Internet AS-graph [PDF]
, 2011 Compact routing algorithms have been presented as candidates for scalable routing in the future Internet, achieving near-shortest path routing with considerably less forwarding state than the Border Gateway Protocol.
Stephen D. Strowes +5 more
core +1 more source
Exploring Graph Traversal Algorithms in Graph-Based Molecular Generation
, 2021 Here, we explore the impact of different graph traversal algorithms on molecular graph generation. We do this by training a graph-based deep molecular generative model to build structures using a node order determined via either a breadth- or depth-first
Engkvist, Ola +8 more
core +1 more source
GraphDuo: A Dual-Model Graph Processing Framework
IEEE Access, 2018 Algorithms for large-scale natural graph processing can be categorized into two types based on their value propagation behaviors: the unidirectional value propagation algorithms and the bidirectional value propagation algorithms. The graph computation in
Xinhui Tian, Jianfeng Zhan
doaj +1 more source