- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Near-optimal distributed dominating set in bounded arboricity graphs ; volume:37 ; number:4 ; day:15 ; month:5 ; year:2023 ; pages:387-398 ; date:12.2024
Distributed computing ; 37, Heft 4 (15.5.2023), 387-398, 12.2024
- Urheber
-
Dory, Michal
Ghaffari, Mohsen
Ilchi, Saeed
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00446-023-00447-z
- URN
-
urn:nbn:de:101:1-2501252116015.679477835632
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 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
- Dory, Michal
- Ghaffari, Mohsen
- Ilchi, Saeed
- SpringerLink (Online service)
Ähnliche Objekte (12)
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms
Planar point sets with bounded ratios of distances
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms
Planar point sets with bounded ratios of distances
Efficient distributed bounded property checking
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Recognizing Map Graphs of Bounded Treewidth
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On sets bounded truth-table reducible to P-selective sets
Approximation of Ellipsoids Using Bounded Uncertainty Sets
Graph Partitioning for Distributed Graph Processing
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Approximating distributed graph algorithms