Monografie
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
- Sprache
-
Englisch
- Umfang
-
XVI, 251 Seiten
- ISBN
-
978-3-7983-2885-3
- Identifier
-
1136332030
- Reihe
-
Foundations of computing; 8
Thema
Berechnungskomplexität ; NP-vollständiges Problem ; Hypergraph ; Teilgraph ; Netzwerk ; Graphenzeichnen ; Effizienter Algorithmus ; Hochschulschrift
Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.04.2024, 08:50 MESZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Algorithmics of large and complex networks : design, analysis, and simulation
Algorithms for the Steiner problem in networks
Dynamics and cooperation : algorithmic challenges in peer to peer computing
Efficient algorithms for production scheduling
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Algorithmics of large and complex networks : design, analysis, and simulation
Algorithms for the Steiner problem in networks
Dynamics and cooperation : algorithmic challenges in peer to peer computing
Efficient algorithms for production scheduling
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exact algorithms for NP hard problems on networks : design, analysis and implementation
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
Algorithmics of large and complex networks : design, analysis, and simulation
Algorithms for the Steiner problem in networks
Dynamics and cooperation : algorithmic challenges in peer to peer computing