The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 347 of Mathematical Reviews Vol. , Issue 84a
[page]
1984
Mathematical Reviews
Preserved Fulltext
Ja’ Ja’, Joseph; Simon, Janos 84a:68069 Space efficient algorithms for some graph theoretical problems. Acta Inform. 17 (1982), no. 4, 411-423. ...
Authors’ summary: “We present space-efficient deterministic O(log’) algorithms for some graph-theoretical problems such as planarity testing, producing a plane embedding, finding minimum cost spanning ...
Optimal In-place Algorithms for Basic Graph Problems
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
while designing in-place algorithms for different graph problems in the future. ...
We present linear time in-place algorithms for several basic and fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality ...
Previous Work on Space Efficient Graph Algorithms In this paper we exclusively deal with space efficient algorithms for graph theoretic problems. ...
arXiv:1907.09280v1
fatcat:hyazbaeeh5duxoid7qwuzkinpm
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
2011
Electronic Proceedings in Theoretical Computer Science
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
As for problems beyond the state space generation, breadth-first search graph traversal algorithms are unsuitable. ...
These new algorithms differed in theoretic complexity as well as practical efficiency. After large experimental evaluation, some of the algorithms were discontinued in DiVinE. ...
doi:10.4204/eptcs.72.1
fatcat:d6qzv6x6pbfmbnur472wf3lvwe
Page 4413 of Mathematical Reviews Vol. , Issue 2002F
[page]
2002
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.
We present an on-line algorithm that solves the problem in general and give an efficient linear-time algorithm for some classes of patterns. ...
Theoret. Comput. Sci. 240 (2000), no. 2, 379-405. Summary: “Spring algorithms are regarded as effective tools for vi- sualizing undirected graphs. ...
Page 6641 of Mathematical Reviews Vol. , Issue 92m
[page]
1992
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.
The main contribution of the paper is an efficient polynomial space al- gorithm for listing unlabeled graphs. ...
Ann (4-EDIN-C) Efficient algorithms for listing unlabeled graphs. ...
Page 4953 of Mathematical Reviews Vol. , Issue 99g
[page]
1999
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.
We consider both graph problems which require that the treewidth or pathwidth of the input graph is bounded by some constant, and graph problems which are hard on general graphs, but have more efficient ...
“The goal of this thesis is to give efficient sequential and parallel algorithms for several problems on graphs of small treewidth or pathwidth. ...
Distributed Verification: Exploring the Power of Raw Computing Power
[chapter]
2007
Lecture Notes in Computer Science
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.
The major hampering factor is the state space explosion problem due to which large industrial models cannot be efficiently handled by a single state-of-the-art computer. ...
These are, for example, techniques to fight memory limits with efficient utilisation of an external I/O device [2, 19, 24, 28, 32] , or techniques that introduce cluster-based algorithms to employ aggregate ...
For example, several efficient and highly parallel algorithms are known for solving the maximum flow problem, which is P-complete. ...
doi:10.1007/978-3-540-70952-7_2
fatcat:tkirbwllp5eenptwi2zk2f6cma
Page 1219 of Mathematical Reviews Vol. , Issue 83c
[page]
1983
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.
{For the entire collection see MR 82k:05003. }
83c:6808 1
Systo, Maciej M. 83c:68082 An efficient cycle vector space algorithm for listing all cycles of a planar graph.
SIAM J. ...
Thus, we show that in
the class of planar graphs, the cycle space approach can be as efficient as the backtrack algorithms.” ...
COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
2013
Computational and Structural Biotechnology 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.
In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. ...
We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. ...
Acknowledgements This work was supported in part by Grant-in-Aid for Scientific Research (KAKENHI) no. 22240009 from JSPS, Japan.
Citation ...
doi:10.5936/csbj.201302004
pmid:24688697
pmcid:PMC3962186
fatcat:lj6f3cmaybhunhcjr3662o3lry
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete problems, for this problem there are not reported superior solutions by these algorithms. ...
In addition to theoretical discussion, the experimental results also verified our idea; for example, in two sample graphs, the probability of reaching to a solution with more than three correct matches ...
Theoretical Discussion In some problems , there are many optimal points in the solution space, which makes easier finding the solution. ...
arXiv:1903.12527v1
fatcat:atvw5lf725gbxevhwhlltrj3aq
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
[article]
2017
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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
other space efficient graph algorithms. ...
We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and 2-edge connectivity, finding cut vertices and cut edges, computing ...
We have presented space efficient algorithms for a number of important applications of DFS. ...
arXiv:1606.08645v3
fatcat:ognvs4na2vc2flf4u3vk6tljey
Optimal In-place Algorithms for Basic Graph Problems
[chapter]
2020
Lecture Notes in Computer Science
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.
while designing in-place algorithms for different graph problems in future. ...
[ESA, 2018] who designed O(n 3 lg n) time in-place algorithms for some of the above mentioned problems. The running times of all our algorithms are essentially optimal as they run in linear time. ...
Previous Work on Space Efficient Graph Algorithms. ...
doi:10.1007/978-3-030-48966-3_10
fatcat:lrodj6wsnrgujbezk4u4byta24
Page 329 of The Journal of the Operational Research Society Vol. 56, Issue 3
[page]
2005
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The neighbourhood move is suitable for inclusion in hybrid local search algorithms. It has an impressive theoretical efficiency, searching K! ...
It may be easier to find good partitions for a sparse graph or one with some geometric structure. However, the efficiency of our search also depends on the number of colours. ...
Preface
2004
Theoretical Computer Science
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.
Some interesting empirical results are also presented. The second paper "A space efficient algorithm for sequence alignment with inversions", by ZhiWu also focuses on computational biology. ...
problem" by Magnus Halldorsson, Kazuo Iwama, Shuichi Miyazaki and Hiroshi Yanagisawa, both study variations of some traditional graph theory problems. ...
As in the previous paper, efficient on-line algorithms were proposed. We wish to thank all the authors for submitting their contributions. ...
doi:10.1016/j.tcs.2004.02.038
fatcat:kcchkqsmbbbxtmryhu7ytt7yc4
Algorithm Engineering: Concepts and Practice
[chapter]
2010
Experimental Methods for the Analysis of Optimization 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 2015; you can also visit the original URL.
The file type is application/pdf.
The results of the latter can then be reused for modifications to the algorithmic design, stronger or input-specific theoretic performance guarantees, etc. ...
Thereby we give an introduction to current algorithmic key issues like I/O-efficient or parallel algorithms, succinct data structures, hardware-aware implementations, and others. ...
step crucial for graph-theoretic problems that build upon it. ...
doi:10.1007/978-3-642-02538-9_6
fatcat:vamy6fe7rvfajdqp2n2k636ani
« Previous
Showing results 1 — 15 out of 188,996 results