1 files changed, 12 insertions, 0 deletions

diff --git a/my_lib.bib b/my_lib.bib
new file mode 100644
index 0000000..4a7e4ae
--- /dev/null
+++ b/my_lib.bib
@@ -0,0 +1,12 @@
+
+@article{tarjanDepthFirst1972,
+  title = {Depth-{{First Search}} and {{Linear Graph Algorithms}}},
+  author = {Tarjan, R.},
+  date = {1972},
+  journaltitle = {SIAM J. Comput.},
+  doi = {10.1137/0201010},
+  abstract = {The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by \$k\_1 V + k\_2 E + k\_3 \$ for some constants \$k\_1 ,k\_2 \$, and \$k\_3 \$, where V is the number of vertices and E is the number of edges of the graph being examined.},
+  file = {/home/yigit/.local/share/zotero/storage/XGDJGERQ/tarjan_1972_depth-first_search_and_linear_graph.pdf}
+}
+
+