Relevant bibliographies by topics / Tarjanov algoritmus

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Tarjanov algoritmus'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tarjanov algoritmus.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tarjanov algoritmus"

1

Lowe, Gavin. "Concurrent depth-first search algorithms based on Tarjan’s Algorithm." International Journal on Software Tools for Technology Transfer 18, no. 2 (2015): 129–47. http://dx.doi.org/10.1007/s10009-015-0382-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

YIN, WEI-GUO, and RUIBAO TAO. "RAPID ALGORITHM FOR IDENTIFYING BACKBONES IN THE TWO-DIMENSIONAL PERCOLATION MODEL." International Journal of Modern Physics C 14, no. 10 (2003): 1427–37. http://dx.doi.org/10.1142/s0129183103005509.

Full text
Abstract:
We present a rapid algorithm for identifying the current-carrying backbone in the two-dimensional percolation model. Taking advantage of the modified Hoshen–Kopelman cluster labeling algorithm, our algorithm identifies dangling parts using their local properties. For planar graphs, it finds the backbone almost four times as fast as the commonly-used Tarjan's depth-first-search algorithm. Comparison with other algorithms for backbone identification is also addressed.
APA, Harvard, Vancouver, ISO, and other styles
3

Bakonyi, Mihály, and Erik M. Varness. "Algorithmic aspects of bipartite graphs." International Journal of Mathematics and Mathematical Sciences 18, no. 2 (1995): 299–304. http://dx.doi.org/10.1155/s0161171295000378.

Full text
Abstract:
We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Ke, and Adrian Dumitrescu. "Selection Algorithms with Small Groups." International Journal of Foundations of Computer Science 31, no. 03 (2020): 355–69. http://dx.doi.org/10.1142/s0129054120500136.

Full text
Abstract:
We revisit the selection problem, namely that of computing the [Formula: see text]th order statistic of [Formula: see text] given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973). Whereas the original algorithm uses groups of odd size at least [Formula: see text] and runs in linear time, it has been perpetuated in the literature that using smaller group sizes will force the worst-case running time to become superlinear, namely [Formula: see text]. We first point out that the usual arguments found in the l
APA, Harvard, Vancouver, ISO, and other styles
5

Chaibou, Amadou, Ousmane Moussa Tessa, and Oumarou Sié. "Modeling the Parallelization of the Edmonds-Karp Algorithm and Application." Computer and Information Science 12, no. 3 (2019): 81. http://dx.doi.org/10.5539/cis.v12n3p81.

Full text
Abstract:
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is equivalent to the problem of the minimum cut, as shown by Fulkerson and Ford (Fulkerson & Ford, 1956). There are several algorithms of the graph’s cut, such as the Ford-Fulkerson algorithm (Ford & Fulkerson, 1962), the Edmonds-Karp algorithm (Edmonds & Karp, 1972) or the Goldberg-Tarjan algorithm (Goldberg & Tarjan, 1988). In this paper, we study the parallel computation of the Edmonds-Karp algorithm which is an optimized version of
APA, Harvard, Vancouver, ISO, and other styles
6

GHIYASVAND, MEHDI. "A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 19, no. 01 (2011): 71–88. http://dx.doi.org/10.1142/s0218488511006897.

Full text
Abstract:
In particular, imprecise observations or possible perturbations mean that data in a network flows may well be better represented by intervals or fuzzy numbers than crisp quantities. In this paper we first consider the minimum cost flow problem with compact interval-valued lower and upper bounds, flows, and costs. We present a new method that shows this problem is solved using two minimum cost flow problems with crisp data. Then this result is extended to networks with fuzzy lower and upper bounds, flows, and costs. One of the best algorithms to solve the minimum cost flow problem with crisp da
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Tarjanov algoritmus"

1

Minárik, Michal. "Modelování elektrických obvodů s využitím diferenciálního počtu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237269.

Full text
Abstract:
This master's thesis deals with modeling of linear electrical circuits through the differential algebraical equation systems. It describes methods of numerical solving, discusses the need of algebraical conversions and possibility of minimalization through the use of parasitic components. In addition, it involves the design and implementation of extension of available simulation tool.
APA, Harvard, Vancouver, ISO, and other styles
2

Silva, Gustavo Peixoto. "Um estudo do algoritmo de Goldberg e Tarjan para o problema de luxo maximo." [s.n.], 1992. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306874.

Full text
Abstract:
Orientador: Clovis Perin Filho<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Científica<br>Made available in DSpace on 2018-07-14T02:44:48Z (GMT). No. of bitstreams: 1 Silva_GustavoPeixoto_M.pdf: 1810173 bytes, checksum: a1944ac8ac4c940f289c30c233c64387 (MD5) Previous issue date: 1992<br>Resumo: Este trabalho consiste no estudo e na implementação do algoritmo de Goldberg e Tarjan para o problema' do fluxo máximo. Este algoritmo tem destacada importância por apresentar uma das complexidades mais baixas e também pelo fato de ab
APA, Harvard, Vancouver, ISO, and other styles
3

Soames, Kieron, and Jonas Lind. "Detecting Cycles in GraphQL Schemas." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-156174.

Full text
Abstract:
GraphQL is a database handling API created by Facebook, that provides an effective al-ternative to REST-style architectures. GraphQL provides the ability for a client to spec-ify exactly what data it wishes to receive. A problem with GraphQL is that the freedomof creating customized requests allows data to be included several times in the response,growing the response’s size exponentially. The thesis contributes to the field of GraphQLanalysis by studying the prevalence of simple cycles in GraphQL schemas. We have im-plemented a locally-run tool and webtool using Tarjan’s and Johnson’s algorit
APA, Harvard, Vancouver, ISO, and other styles
4

(8802671), Jiaxin Sun. "A software visualization-based approach for understanding and analyzing incremental implementations of complex graph-based algorithms." Thesis, 2020.

Find full text
Abstract:
Algorithm has always been a challenging topic for students to learn because of its high level of abstraction. To provide visual aid for algorithm education, many algorithm visualization systems have been designed, developed, and evaluated for the last two decades. However, neither the topics covered nor the interactivity of most AV systems are satisfying. This problem is presented in detail in chapter 2. As a result, this research aims to design, implement and evaluate a compiler-based algorithm visualization system on complex graph algorithm implementation with the assumption that it can help
APA, Harvard, Vancouver, ISO, and other styles
5

(9158723), Supriyo Maji. "Efficient Minimum Cycle Mean Algorithms And Their Applications." Thesis, 2020.

Find full text
Abstract:
<p>Minimum cycle mean (MCM) is an important concept in directed graphs. From clock period optimization, timing analysis to layout optimization, minimum cycle mean algorithms have found widespread use in VLSI system design optimization. With transistor size scaling to 10nm and below, complexities and size of the systems have grown rapidly over the last decade. Scalability of the algorithms both in terms of their runtime and memory usage is therefore important. </p> <p><br></p> <p>Among the few classical MCM algorithms, the algorithm by Young, Tarjan, and Orlin (YTO), has been particularly popul
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Tarjanov algoritmus"

1

Geldenhuys, Jaco, and Antti Valmari. "Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24730-2_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tarjanov algoritmus"

1

Girolimetto, Marina, Rodrigo S. Tessinari, Fabio O. Lima, Claunir Pavan, and Marcia H. M. Paiva. "Exploiting the diversity of shortest pairs of edge-disjoint paths." In Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/sbrc.2018.2473.

Full text
Abstract:
In an optical network, given a pair of source and destination nodes, some algorithm can be used to find shortest pairs of edge-disjoint paths to be used as working and backup paths. The Suurballe and Tarjan's algorithm is a solution, but it can found different shortest pairs of pathways interconnecting the same pair of source and destination nodes. In this paper, two versions of the Suurballe and Tarjan's algorithm is proposed to deal with that diversity. For each node pair of a given network topology, these versions find the most balanced shortest pair of working and backup paths and the leas
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography