Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2928580
Jump to:navigation, search

zbMath1301.05329MaRDI QIDQ2928580

Pierre Charbit, Antoine Mamcarz, Michel A. Habib

Publication date: 10 November 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2519/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

BFSgraph algorithmsgraph searchDFSLBFSLDFSend-vertex problem


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (8)

Recognizing graph search trees ⋮ Graph searches and their end vertices ⋮ End-Vertices of Graph Search Algorithms ⋮ Linearizing partial search orders ⋮ End vertices of graph searches on bipartite graphs ⋮ End-vertices of LBFS of (AT-free) bigraphs ⋮ The Recognition Problem of Graph Search Trees ⋮ On the recognition of search trees generated by BFS and DFS


Uses Software

  • Algorithm 447



This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2928580&oldid=15904962"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki