- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Matching Cut in Graphs with Large Minimum Degree ; day:23 ; month:11 ; year:2020 ; pages:1-18
Algorithmica ; (23.11.2020), 1-18
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-020-00782-8
- URN
-
urn:nbn:de:101:1-2021010319544486907199
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Chen, Chi-Yeh
- Hsieh, Sun-Yuan
- Le, Hoang-Oanh
- Le, Van Bang
- Peng, Sheng-Lung
- SpringerLink (Online service)
Ähnliche Objekte (12)
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks
Cut problems on graphs
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks
Cut problems on graphs
Minimum Degree Stability of H-Free Graphs
The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two
On the minimum degree of minimal Ramsey graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
Minimum Cut Tree Games
Non-solvable groups whose character degree graph has a cut-vertex. III
Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I
Degree heuristics for matching
Degree heuristics for matching
Minimum Fundamental Cut Basis Problem
Minimum Cut Bases in Undirected Networks