Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Authors
Prafullkumar Tale (ORCID: https://orcid.org/0000-0001-9753-0523)
Narges Ghareghani
Lucas Lorieau
Rasa Parvini Oskuei
Institutions
Indian Institute of Science Education and Research Pune (IN)
University of Tehran (IR)
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (FR)
Publication Details
Journal
SPIRE - Sciences Po Institutional REpository
Published
2026-02-12
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Prafullkumar Tale, Narges Ghareghani, Lucas Lorieau, Rasa Parvini Oskuei
Journal
SPIRE - Sciences Po Institutional REpository
Topics
Computational Geometry and Mesh Generation
article
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Prafullkumar Tale, Narges Ghareghani, Lucas Lorieau, Rasa Parvini Oskuei
article en
Abstract
No abstract available for this paper.
Publication Tag
SPIRE - Sciences Po Institutional REpository
Institutions
Indian Institute of Science Education and Research Pune (IN), University of Tehran (IR), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (FR)
Ask Laika to Summarize, Analyze, and Connect papers live on the map.
Summarize Papers & Methodologies
Extract key findings, datasets, and comparative methods across publications.
Benchmark Rankings & Visual Analytics
Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.
Connect Distant Disciplines
Bridge topological clusters on the map to find hidden collaborative intersections.
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs — Prafullkumar Tale, Narges Ghareghani, et al. · SPIRE - Sciences Po Institutional REpository (2026) | TGRS Research Map | TGRS