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
Finding the Maximum Subgraph of Prescribed Strength
Finding the Maximum Subgraph of Prescribed Strength
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Masoud Eshghali
,
Pavlo Krokhmal
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
On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
by: Petersen, Johannes B. S., et al.
Published: (2025)
Chance-Constrained Set Multicover Problem
by: Yao, Shunyu, et al.
Published: (2024)
Finding Densest Subgraphs with Edge-Color Constraints
by: Oettershagen, Lutz, et al.
Published: (2024)
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
by: Jannick Borowitz, et al.
Published: (2026)
