عنوان
پدید آورنده
موضوع
رده
QA76.9.A43
QA76
.
9
.
A43
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
3030174018
(Number (ISBN
3030174026
(Number (ISBN
3030174034
(Number (ISBN
9783030174019
(Number (ISBN
9783030174026
(Number (ISBN
9783030174033
Erroneous ISBN
9783030174019
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Algorithms and complexity :
General Material Designation
[Book]
Other Title Information
11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings /
First Statement of Responsibility
Pinar Heggernes (ed.).
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cham, Switzerland :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
2019.
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (xiii, 378 pages) :
Other Physical Details
illustrations (some color)
SERIES
Series Title
Lecture notes in computer science ;
Series Title
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Volume Designation
11485
GENERAL NOTES
Text of Note
Includes author index.
Text of Note
International conference proceedings.
CONTENTS NOTE
Text of Note
Intro; Preface; Organization; Contents; Quadratic Vertex Kernel for Split Vertex Deletion; 1 Introduction; 2 Preliminaries; 3 The Quadratic Kernel; 4 Kernelization Lower Bound; 5 Concluding Remarks; References; The Temporal Explorer Who Returns to the Base; 1 Introduction and Motivation; 2 Efficient Algorithm for k3 Labels per Edge; 3 Hardness for k4 Labels per Edge; 3.1 StarExp(k) is NP-complete for k6 Labels per Edge; 3.2 MaxStarExp(k) is APX-complete for k4 Labels per Edge; References; Minimum Convex Partition of Point Sets; 1 Introduction; 2 Experimental Environment
Text of Note
2 Existence of a Pure Strategy Nash Equilibrium3 Social Utility and the Price of Anarchy/Stability; 3.1 Games with Identical Rewards; 3.2 Games with Non Identical Rewards; 4 Egalitarian Social Welfare; 5 Conclusion and Open Problems; References; Subgraph Isomorphism on Graph Classes that Exclude a Substructure; 1 Introduction; 1.1 Our Results; 2 Preliminaries and Basic Observations; 2.1 Graphs Forbidding a Short Path as a Minor; 3 Forbidding a Connected Graph as a Minor; 4 Forbidding a Disconnected Graph as a Minor; 4.1 Subgraph Isomorphism on (P4 k P3)-Minor Free Graphs
Text of Note
3 A Mathematical Model for the mcpp4 Heuristics; 5 Computational Results; 6 Final Remarks; References; Parameterized Complexity of Safe Set; 1 Introduction; 2 Preliminaries; 3 W[2]-Hardness Parameterized by Pathwidth; 4 No Polynomial Kernel Parameterized by Vertex Cover Number; 5 FPT Algorithm Parameterized by Neighborhood Diversity; 6 XP Algorithm Parameterized by Clique-Width; 7 Faster Algorithms Parameterized by Solution Size; References; Parameterized Complexity of Diameter; 1 Introduction; 2 Preliminaries and Basic Observations; 3 Deletion Distance to Special Graph Classes
Text of Note
4 Parameters for Social Networks4.1 Degree Related Parameters; 4.2 Parameters Related to Both Diameter and h-Index; 5 Conclusion; References; Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints; 1 Introduction; 1.1 Our Contributions and Organization of this Work; 1.2 Related Work; 2 Preliminaries; 3 Finding Strong Links in Social Networks; 4 Representative Families for Matroid Intersections and Set Packing with Multiple Matroid Constraints; 5 A Fixed-Parameter Algorithm for UFLP-MC; 6 Conclusion; References; Project Games; 1 Introduction
Text of Note
4.2 Subgraph Isomorphism on 4 P5-Minor Free Graphs5 Concluding Remarks; References; Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors; 1 Introduction; 2 Classical and Fine-Grained Complexity; 3 Parameterized Complexity; References; k-cuts on a Path; 1 Introduction and Main Results; 1.1 The k-cut Number of a Graph; 1.2 The k-cut Number of a Tree; 1.3 The k-cut Number of a Path; 2 The Moments; 2.1 The Expectation; 2.2 The Variance; 2.3 Higher Moments; 3 Convergence to the k-cut Distribution; 4 Some Extensions
0
8
8
8
8
SUMMARY OR ABSTRACT
Text of Note
This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019. The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.
ACQUISITION INFORMATION NOTE
Source for Acquisition/Subscription Address
Springer Nature
Stock Number
com.springer.onix.9783030174026
OTHER EDITION IN ANOTHER MEDIUM
International Standard Book Number
3030174018
PARALLEL TITLE PROPER
Parallel Title
CIAC 2019
TOPICAL NAME USED AS SUBJECT
Algorithms, Congresses.
Computational complexity, Congresses.
Algorithms.
Computational complexity.
(SUBJECT CATEGORY (Provisional
COM051300
UMB
UMB
DEWEY DECIMAL CLASSIFICATION
Number
518
.
1
Edition
23
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA76
.
9
.
A43
PERSONAL NAME - ALTERNATIVE RESPONSIBILITY
Heggernes, Pinar
CORPORATE BODY NAME - PRIMARY RESPONSIBILITY
International Conference on Algorithms and Complexity(11th :2019 :, Rome, Italy)
ORIGINATING SOURCE
Date of Transaction
20200823085527.0
Cataloguing Rules (Descriptive Conventions))
pn
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
