top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Parameterized and Exact Computation [[electronic resource] ] : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows
Parameterized and Exact Computation [[electronic resource] ] : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (X, 298 p.)
Disciplina 519.5/44
Collana Lecture Notes in Computer Science
Soggetto topico Algorithms
Probabilities
Application software
Computers
Data structures (Computer science)
Computer science—Mathematics
Algorithm Analysis and Problem Complexity
Probability Theory and Stochastic Processes
Computer Applications
Computation by Abstract Devices
Data Structures
Discrete Mathematics in Computer Science
ISBN 1-280-30821-4
9786610308217
3-540-28639-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly( k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications.
Record Nr. UNISA-996465317803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Parameterized and Exact Computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows
Parameterized and Exact Computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows
Edizione [1st ed. 2004.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica 1 online resource (X, 298 p.)
Disciplina 519.5/44
Collana Lecture Notes in Computer Science
Soggetto topico Algorithms
Probabilities
Application software
Computers
Data structures (Computer science)
Computer science—Mathematics
Algorithm Analysis and Problem Complexity
Probability Theory and Stochastic Processes
Computer Applications
Computation by Abstract Devices
Data Structures
Discrete Mathematics in Computer Science
ISBN 1-280-30821-4
9786610308217
3-540-28639-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly( k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications.
Record Nr. UNINA-9910144349103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui