| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465886903316 |
|
|
Titolo |
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2001.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 334 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 2204 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computers |
Data structures (Computer science) |
Algorithms |
Computer science—Mathematics |
Programming Techniques |
Theory of Computation |
Data Structures and Information Theory |
Algorithm Analysis and Problem Complexity |
Discrete Mathematics in Computer Science |
Data Structures |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- |
|
|
|
|
|
|
|
|
|
|
|
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910158905903321 |
|
|
Autore |
BA Tortuga |
|
|
Titolo |
What She Wants |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Soggetti |
|
Open marriage |
Romance fiction |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Sommario/riassunto |
|
Calleigh and Adrian might have an open relationship, but she's tired of staying home. She wants Adrian, and his lover, Packer, to be all hers.Calleigh and Adrian have always had an open marriage. Adrian being on the road all the time has made it easy for them to have separate lives, but neither of them acted on their agreement to see other people until Adrian met fellow Aussie and force of nature Packer Stephens.Now Packer and Adrian are always together and Calleigh is left at home, missing her man. When Calleigh decides she's not going to let Adrian go without a fight, she comes up with what she thinks is the perfect plan. She hits the spa and the gym and sets out to find her inner buckle bunny, intent on getting her bull-rider back, and maybe on impressing Packer a little, too. She heads out on the road, ready to fight for her husband.What Calleigh doesn't understand is that her plan will be wildly successful and also the hardest thing she's ever done in her life. Packer is more than willing to play, but he's as complicated as Calleigh is emotional. And as much as he loves Calleigh and Packer, and the sexy games they play, Adrian has to try to set things right, but can he find a way to give Calleigh what she wants and make everyone else happy at the same time? |
|
|
|
|
|
|
|
| |