Lower And Upper Bounds for Degree-Dependent Spanning Tree Problems

Authors

Publication Details

Journal
SPIRE - Sciences Po Institutional REpository
Published
2025-10-24
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lower And Upper Bounds for Degree-Dependent Spanning Tree Problems

Massinissa Merabet, Matthieu Desprez
SPIRE - Sciences Po Institutional REpository
Complexity and Algorithms in Graphs
article

Lower And Upper Bounds for Degree-Dependent Spanning Tree Problems

Massinissa Merabet, Matthieu Desprez
article en

Abstract

No abstract available for this paper.
SPIRE - Sciences Po Institutional REpository
Partnerships for the goals
Openalex Percentile: Top 23%
Complexity and Algorithms in Graphs
OpenAlex
AI Navigator

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.

Lower And Upper Bounds for Degree-Dependent Spanning Tree Problems — Massinissa Merabet, Matthieu Desprez · SPIRE - Sciences Po Institutional REpository (2025) | TGRS Research Map | TGRS