- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1863-8279
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Classification
-
Wirtschaft
- Creator
-
Ghirardi, Marco
Salassa, Fabio
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s11750-021-00610-4
- URN
-
urn:nbn:de:101:1-2021100206304574406505
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:35 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ghirardi, Marco
- Salassa, Fabio
- SpringerLink (Online service)
Other Objects (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