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.
Graph Theory, Computational Intelligence and Thought [[electronic resource] ] : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell
| Graph Theory, Computational Intelligence and Thought [[electronic resource] ] : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (237 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Artificial Intelligence Formal Languages and Automata Theory Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN |
1-282-29777-5
9786612297779 3-642-02029-1 |
| Classificazione |
DAT 357f
MAT 055f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Landmarks in Algorithmic Graph Theory: A Personal Retrospective -- A Higher-Order Graph Calculus for Autonomic Computing -- Algorithms on Subtree Filament Graphs -- A Note on the Recognition of Nested Graphs -- Asynchronous Congestion Games -- Combinatorial Problems for Horn Clauses -- Covering a Tree by a Forest -- Dominating Induced Matchings -- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results -- Local Search Heuristics for the Multidimensional Assignment Problem -- On Distance-3 Matchings and Induced Matchings -- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph -- On Path Partitions and Colourings in Digraphs -- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 -- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs -- O(m logn) Split Decomposition of Strongly Connected Graphs -- Path-Bicolorable Graphs -- Path Partitions, Cycle Covers and Integer Decomposition -- Properly Coloured Cycles and Paths: Results and Open Problems -- Recognition of Antimatroidal Point Sets -- Tree Projections: Game Characterization and Computational Aspects. |
| Record Nr. | UNISA-996465872603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Theory, Computational Intelligence and Thought : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell
| Graph Theory, Computational Intelligence and Thought : Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (237 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Artificial Intelligence Formal Languages and Automata Theory Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN |
9786612297779
9781282297777 1282297775 9783642020292 3642020291 |
| Classificazione |
DAT 357f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Landmarks in Algorithmic Graph Theory: A Personal Retrospective -- A Higher-Order Graph Calculus for Autonomic Computing -- Algorithms on Subtree Filament Graphs -- A Note on the Recognition of Nested Graphs -- Asynchronous Congestion Games -- Combinatorial Problems for Horn Clauses -- Covering a Tree by a Forest -- Dominating Induced Matchings -- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results -- Local Search Heuristics for the Multidimensional Assignment Problem -- On Distance-3 Matchings and Induced Matchings -- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph -- On Path Partitions and Colourings in Digraphs -- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 -- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs -- O(m logn) Split Decomposition of Strongly Connected Graphs -- Path-Bicolorable Graphs -- Path Partitions, Cycle Covers and Integer Decomposition -- Properly Coloured Cycles and Paths: Results and Open Problems -- Recognition of Antimatroidal Point Sets -- Tree Projections: Game Characterization and Computational Aspects. |
| Record Nr. | UNINA-9910483870403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||