A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
2015
Journal of combinatorial optimization
Preserved Fulltext
The suggested algorithm builds the same colouring of the graph as the well-known greedy sequential heuristic in which on every step the current vertex is coloured in the minimum possible colour. ...
Our main contributions include introduction of a special matrix of forbidden colours and application of efficient bitwise operations on bit representations of the adjacency and forbidden colours matrices ...
Acknowledgments The work is conducted at National Research University Higher School of Economics and supported by RSF Grant 14-41-00039. ...
doi:10.1007/s10878-015-9862-1
fatcat:omlb3zqzzbfd5gwpik5lngw3eu
Page 805 of Mathematical Reviews Vol. , Issue 82b
[page]
1982
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Authors’ summary: “Many heuristic polynomial time algorithms exist to colour the vertices of connected undirected graphs having no loops or multiple edges. ...
Associated with each such algorithm are graphs for which the number of colours required in the colouring produced by the algorithm is significantly greater than the minimum that are necessary. ...
An analysis of the graph processing landscape
2021
Journal of Big Data
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For these systems focused on processing the bulk of graph elements, common use-cases consist in executing for example algorithms for vertex ranking or community detection, which produce insights on graph ...
For the use-case of performing global computations over a graph, it is first ingested into a graph processing system from one of many digital representations. ...
The authors note that common colouring algorithms may suffer from low parallelism due to a large number of colours being needed to process large graphs with billions of vertices. ...
doi:10.1186/s40537-021-00443-9
pmid:33850687
pmcid:PMC8033100
fatcat:vnwcn2pwszhv3detnwcv6jrthu
Fast parallel algorithm to the minimum edge cover problem based on DNA molecular computation
2013
Applied Mathematics & Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
vertices or edges solutions result, such as the minimum edge cover problem, graph colouring problem and so on. ...
For an undirected and simple graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions ...
The authors are grateful to the anonymous referee for a careful checking of the details and for helpful comments that improved this paper. ...
doi:10.12785/amis/072l48
fatcat:y5wqcmjjvfalte3qrgzpjwjm7y
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2108.13113v2 fatcat:xybarfg6kza7znkebcpks777xeOther Versions
The large number of vertices prevents us from analysing such graphs using explicit SCC detection algorithms, such as Tarjan's, which motivates the use of a symbolic approach. ...
The size of edge-coloured graphs appearing in practice can be enormous both in the number of vertices and colours. ...
In [BBB + 17, BBP + 19] we have initially attacked the SCC decomposition problem for massive edge-coloured graphs by developing a parallel, semi-symbolic algorithm for detection of bottom SCCs. ...
arXiv:2108.13113v3
fatcat:hblyf6tm4fbzvk6un3b5ka5i6y
A complete resolution of the Keller maximum clique problem
[chapter]
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Keller graphs are in the benchmark set of clique problems from the DIMACS clique challenge, and they appear to be especially difficult for clique algorithms. ...
A d-dimensional Keller graph has vertices which are numbered with each of the 4 d possible d-digit numbers (d-tuples) which have each digit equal to 0, 1, 2, or 3. ...
A specific colouring of the Keller graph vertices is exploited by the clique algorithm. Understanding this colouring is critical for verification of the isomorphism screening described in Section 6. ...
doi:10.1137/1.9781611973082.11
dblp:conf/soda/DebroniELMSW11
fatcat:g7o42lagwzasffyh4te2et5eca
Benchmarking of Graph Partitioning Tools and Techniques
2019
International journal of recent technology and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper the authors have used a systematic literature review to provide benchmarking on influencing parameters for graph partitioning tools, which is the principal contribution of the present paper ...
Also authors have suggested future research directions and anomalies for improvement in tools and techniques for Graph Partitioning. ...
Features: Mainly used by data analysts and scientists intense to discover and distinguish graphs. It is similar Photoshop tool but used for graph data through representation, manipulation of data, ...
doi:10.35940/ijrte.d7369.118419
fatcat:hy2qdjhk6zbd5al5up26qce7yy
Optimal parallel algorithms on planar graphs
1990
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Few existing parallel graph algorithms achieve optimality when applied to very sparse graphs such as planar graphs. ...
It has been known for some time that for graphs with n vertices and m edges, all of the above problems can be solved in O(log n) time on a CRCW PRAM with O(n + m) processors. ...
Then let I= 0 and step through the set of new colours, for each colour simultaneously adding to I all vertices of that colour that have no neighbours in I. ...
doi:10.1016/0890-5401(90)90034-f
fatcat:w3zm46mljvh73cqhrctew5ukfi
Bitboard Methods for Games
2014
ICGA Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Bitboards allow the efficient encoding of games for computer play and the application of fast bitwiseparallel algorithms for common game-related operations. ...
, and (3) a sampling of bitboard algorithms for a range of games other than chess, with notes on their performance and practical application. ...
Flip Updates Algorithm 9 shows a bitwise-parallel algorithm for flipping all adjacent enemy pieces to a player's colour. ...
doi:10.3233/icg-2014-37202
fatcat:vbb63uxs4je5dnwr33l5qugsli
Quantum inspired cuckoo search algorithm for graph colouring problem
2015
International Journal of Bio-Inspired Computation (IJBIC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we try to solve the graph coloring problem using a new approach based on the quantum inspired cuckoo search algorithm. ...
To show the feasibility and the effectiveness of the algorithm, we have used the standard DIMACS benchmark, and the obtained results are very encouraging. ...
In the initialization step, the developed algorithm called QICSACOL (Quantum Inspired Cuckoo Search Algorithm for Graph COLoring), generates the initial population of nests by using the RLF algorithm ...
doi:10.1504/ijbic.2015.069554
fatcat:urza3pid7fdvxfo7an2j5hrsbu
A Complete Graphical Calculus for Spekkens' Toy Bit Theory
2015
Foundations of physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
These models are also used to explore the question of ψ-ontic versus ψ-epistemic theories for quantum mechanics. Spekkens' toy theory is one such model. ...
Thus Spekkens' toy bit theory and stabilizer quantum mechanics can be analysed and compared using analogous graphical formalisms. ...
Acknowledgements The authors would like to thank Dominic Horsman and Matt Pusey for comments on drafts of this paper. MB acknowledges financial support from the EPSRC. ...
doi:10.1007/s10701-015-9957-7
fatcat:vtnfcnci6bdkdniwdlznmx6ymu
A Parallel Quantum Histogram Architecture
2013
IEEE Transactions on Circuits and Systems - II - Express Briefs
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A parallel formulation of an algorithm for the histogram computation of n data items using an on-the-fly data decomposition and a novel quantum-like representation (QR) is developed. ...
Index Terms-Histogram, parallel architectures, parallel algorithms, quantum representation. G. M. Megson is with the ...
As a result of the consequent reformulation and manipulation of the algorithm, the internal structure of the cells is simplified compared to [3, 4] and consequently array architectures for processing ...
doi:10.1109/tcsii.2013.2258263
fatcat:hhuleaahyfgaxkbvcwvbjtgswi
Fast Computation of Small Cuts via Cycle Space Sampling
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In the model of distributed computing in a graph G=(V, E) with O(log V)-bit messages, our approach yields faster algorithms for several problems. ...
This leads to simple new linear-time sequential algorithms for finding all cut edges and cut pairs (a set of 2 edges that form a cut) of a graph. ...
Alg. for valuable feedback. ...
arXiv:cs/0702113v5
fatcat:stbkbsbpdncbbaeeircnzcdfwa
Janus: An FPGA-Based System for High-Performance Scientific Computing
2009
Computing in science & engineering (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
JANUS is tailored for, but not limited to, the requirements of a class of hard scientific applications characterized by regular code structure, unconventional data manipulation instructions and not too ...
We discuss the architecture of this configurable machine, and focus on its use on Monte Carlo simulations of statistical mechanics. ...
Sialino for their outstanding support during the commissioning of the first JANUS system. ...
doi:10.1109/mcse.2009.11
fatcat:uy6fojv45jcslf5pkgjzzoikmq
CytoASP: a Cytoscape app for qualitative consistency reasoning, prediction and repair in biological networks
2015
BMC Systems Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Results: We report the implementation of CytoASP, an app that allows the use of BioASP for influence graph consistency checking, prediction and repair operations through Cytoscape. ...
Conclusion: We have presented a user-friendly Cytoscape app for the analysis of regulatory networks using BioASP. ...
The software takes advantage of the extensive BioASP functionality in manipulating influence graphs, allowing for the modelling of large scale regulatory networks and dealing with inconsistency with extensive ...
doi:10.1186/s12918-015-0179-6
pmid:26163265
pmcid:PMC4499222
fatcat:dj2jhvwgrvcifamqb7j37gfeoi
« Previous
Showing results 1 — 15 out of 3,400 results