Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The Minimum Clique Routing Problem on Cycles
The Minimum Clique Routing Problem on Cycles
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
M. Escalante
,
P. Tolomei
,
M. Matamala
,
I. Rapaport
,
L. M. Torres
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Evading Community Detection via Counterfactual Neighborhood Search
by: Bernini, Andrea, et al.
Published: (2023)
The Right to Hide: Masking Community Affiliation via Minimal Graph Rewiring
by: Silvestri, Matteo, et al.
Published: (2025)
Deterministic Distributed DFS and Other Problems via Cycle Separators in Planar Graphs
by: Jauregui, Benjamin, et al.
Published: (2025)
Clique counts for network similarity
by: Bonato, Anthony, et al.
Published: (2024)
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
by: Yingli Ran, et al.
Published: (2024)