All graphs have cycle separators and planar directed depth-first search is in DNC

VLSI Algorithms and Architectures - Lecture Notes in Computer Science ◽

10.1007/bfb0040373 ◽

2006 ◽

pp. 53-63 ◽

Cited By ~ 10

Author(s):

Ming-Yang Kao

Keyword(s):

Depth First Search

A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation

2020 16th International Conference on Network and Service Management (CNSM) ◽

10.23919/cnsm50824.2020.9269062 ◽

2020 ◽

Author(s):

Onur Ugurlu ◽

Vahid Khalilpour Akram ◽

Deniz Tursel Eliiyi

Keyword(s):

Edge Connectivity ◽

Depth First Search

Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets

IFAC-PapersOnLine ◽

10.1016/j.ifacol.2021.04.037 ◽

2020 ◽

Vol 53 (4) ◽

pp. 378-383

Author(s):

I. Saadaoui ◽

Z. Li ◽

N. Wu ◽

M. Khalgui

Keyword(s):

Petri Nets ◽

Depth First Search ◽

Search Approach

A dataflow-oriented VLSI architecture for a modified SPIHT algorithm using depth-first search bit stream processing

2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353) ◽

10.1109/iscas.2000.857087 ◽

2002 ◽

Cited By ~ 2

Author(s):

Li-Minn Ang ◽

Hon Nin Cheung ◽

K. Eshraghian

Keyword(s):

Stream Processing ◽

Vlsi Architecture ◽

Depth First Search ◽

Spiht Algorithm ◽

Bit Stream

Parallel execution of an irregular algorithm depth first search (DFS) on heterogeneous clusters of workstation

2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01EX479) ◽

10.1109/icii.2001.983078 ◽

2002 ◽

Cited By ~ 1

Author(s):

M.A.M. Ibrahim ◽

L. Xinda ◽

J.M. Rwakarambi

Keyword(s):

Parallel Execution ◽

Heterogeneous Clusters ◽

Depth First Search

Two Streamlined Depth-First Search Algorithms

Fundamenta Informaticae ◽

10.3233/fi-1986-9105 ◽

1986 ◽

Vol 9 (1) ◽

pp. 85-94

Author(s):

Robert Endre Tarjan

Keyword(s):

Directed Graph ◽

Graph Algorithms ◽

Undirected Graph ◽

Linear Time ◽

Search Algorithms ◽

Depth First Search ◽

Time Graph

Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.

Cooperative particle swarm optimizer with depth first search strategy for global optimization of multimodal functions

Applied Intelligence ◽

10.1007/s10489-021-03005-x ◽

2022 ◽

Author(s):

Jie Wang ◽

Yongfang Xie ◽

Shiwen Xie ◽

Xiaofang Chen

Keyword(s):

Global Optimization ◽

Search Strategy ◽

Particle Swarm ◽

Particle Swarm Optimizer ◽

Depth First Search ◽

Multimodal Functions

Pre-processed Depth First Search

Information Intelligence, Systems, Technology and Management - Communications in Computer and Information Science ◽

10.1007/978-3-642-19423-8_23 ◽

2011 ◽

pp. 214-220

Author(s):

Rushabh Hathi ◽

Irfan A. Siddavatam

Keyword(s):

Depth First Search

Depth-First Search

Graph Algorithms ◽

10.1017/cbo9781139015165.006 ◽

2012 ◽

pp. 46-64 ◽

Cited By ~ 3

Author(s):

Shimon Even

Keyword(s):

Depth First Search

Scalable Parallel Formulations of Depth-First Search

Parallel Algorithms for Machine Intelligence and Vision ◽

10.1007/978-1-4612-3390-9_1 ◽

1990 ◽

pp. 1-41 ◽

Cited By ~ 14

Author(s):

Vipin Kumar ◽

V. Nageshwara Rao

Keyword(s):

Depth First Search

Fully dynamic depth-first search in directed graphs

Proceedings of the VLDB Endowment ◽

10.14778/3364324.3364329 ◽

2019 ◽

Vol 13 (2) ◽

pp. 142-154

Author(s):

Bohua Yang ◽

Dong Wen ◽

Lu Qin ◽

Ying Zhang ◽

Xubo Wang ◽

...

Keyword(s):

Directed Graphs ◽

Depth First Search