default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 23
Volume 23, November 2013
- S. Arumugam
, William F. Smyth:
Editorial. 1
- Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan:
Finding dominators via disjoint set union. 2-20 - Florent Foucaud, Matjaz Kovse:
Identifying path covers in graphs. 21-34 - S. Monikandan, P. Anusha Devi, S. Sundar Raj:
Degree associated edge reconstruction number of graphs. 35-41 - Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Acyclic coloring with few division vertices. 42-53 - Jay Mahadeokar, Sanjeev Saxena:
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs. 54-62 - Meenakshi Wasadikar, Pradnya Survase:
Lattices, whose incomparability graphs have horns. 63-75 - Tao-Ming Wang, Guang-Hui Zhang:
On antimagic labeling of regular graphs with particular factors. 76-82
- Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Weak heaps engineered. 83-97
- Richard Beal, Donald A. Adjeroh:
The structural border array. 98-112 - Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the partial word avoidability indices of binary patterns. 113-118 - Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the partial word avoidability indices of ternary patterns. 119-142 - Pritom Ahmed, A. S. M. Shohidull Islam, M. Sohel Rahman:
A graph-theoretic model to solve the approximate string matching problem allowing for translocations. 143-156 - R. Arulprakasam, V. Rajkumar Dare, S. Gnanasekaran:
Fuzzy local ω-systems. 157-164
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
