- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1863-8279
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A simple and effective algorithm for the maximum happy vertices problem ; day:9 ; month:6 ; year:2021 ; pages:1-13
Top ; (9.6.2021), 1-13
- Klassifikation
-
Wirtschaft
- Urheber
-
Ghirardi, Marco
Salassa, Fabio
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s11750-021-00610-4
- URN
-
urn:nbn:de:101:1-2021100206304574406505
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 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
- Ghirardi, Marco
- Salassa, Fabio
- SpringerLink (Online service)
Ähnliche Objekte (12)
Vertex labellings of simple graphs
Cycling examples for the shadow vertex algorithm
An Improved FPT Algorithm for Independent Feedback Vertex Set
Rearrangement algorithm and maximum entropy
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
On the maximum ABC index of bipartite graphs without pendent vertices
Theoretical Analysis of Hierarchical Clustering and the Shadow Vertex Algorithm
All one-loop scalar vertices in the effective potential approach
Vertex
The advanced-maximum-linkage clustering-algorithm
The Advanced-Maximum-Linkage Clustering-Algorithm
From spin vertex to string vertex
Vertex labellings of simple graphs
Cycling examples for the shadow vertex algorithm
An Improved FPT Algorithm for Independent Feedback Vertex Set
Rearrangement algorithm and maximum entropy
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
On the maximum ABC index of bipartite graphs without pendent vertices
Theoretical Analysis of Hierarchical Clustering and the Shadow Vertex Algorithm
All one-loop scalar vertices in the effective potential approach
Vertex
The advanced-maximum-linkage clustering-algorithm
The Advanced-Maximum-Linkage Clustering-Algorithm
From spin vertex to string vertex
Vertex labellings of simple graphs
Cycling examples for the shadow vertex algorithm
An Improved FPT Algorithm for Independent Feedback Vertex Set
Rearrangement algorithm and maximum entropy
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
On the maximum ABC index of bipartite graphs without pendent vertices
Theoretical Analysis of Hierarchical Clustering and the Shadow Vertex Algorithm
All one-loop scalar vertices in the effective potential approach
Vertex
The advanced-maximum-linkage clustering-algorithm
The Advanced-Maximum-Linkage Clustering-Algorithm