عنوان
پدید آورنده
موضوع
رده
QA76.9.A43
QA76
.
9
.
A43
کتابخانه
محل استقرار
شابک
شابک
3030174018
شابک
3030174026
شابک
3030174034
شابک
9783030174019
شابک
9783030174026
شابک
9783030174033
شابک اشتباه
9783030174019
عنوان و نام پديدآور
عنوان اصلي
Algorithms and complexity :
نام عام مواد
[Book]
ساير اطلاعات عنواني
11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings /
نام نخستين پديدآور
Pinar Heggernes (ed.).
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Cham, Switzerland :
نام ناشر، پخش کننده و غيره
Springer,
تاریخ نشرو بخش و غیره
2019.
مشخصات ظاهری
نام خاص و کميت اثر
1 online resource (xiii, 378 pages) :
ساير جزييات
illustrations (some color)
فروست
عنوان فروست
Lecture notes in computer science ;
عنوان فروست
LNCS sublibrary. SL 1, Theoretical computer science and general issues
مشخصه جلد
11485
يادداشت کلی
متن يادداشت
Includes author index.
متن يادداشت
International conference proceedings.
یادداشتهای مربوط به مندرجات
متن يادداشت
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
متن يادداشت
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
متن يادداشت
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
متن يادداشت
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
متن يادداشت
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
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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.
یادداشتهای مربوط به سفارشات
منبع سفارش / آدرس اشتراک
Springer Nature
شماره انبار
com.springer.onix.9783030174026
ویراست دیگر از اثر در قالب دیگر رسانه
شماره استاندارد بين المللي کتاب و موسيقي
3030174018
عنوان اصلی به زبان دیگر
عنوان اصلي به زبان ديگر
CIAC 2019
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Algorithms, Congresses.
موضوع مستند نشده
Computational complexity, Congresses.
موضوع مستند نشده
Algorithms.
موضوع مستند نشده
Computational complexity.
مقوله موضوعی
موضوع مستند نشده
COM051300
موضوع مستند نشده
UMB
موضوع مستند نشده
UMB
رده بندی ديویی
شماره
518
.
1
ويراست
23
رده بندی کنگره
شماره رده
QA76
.
9
.
A43
نام شخص - (مسئولیت معنوی برابر )
مستند نام اشخاص تاييد نشده
Heggernes, Pinar
نام تنالگان به منزله سر شناسه - (مسئولیت معنوی درجه اول )
مستند نام تنالگان تاييد نشده
International Conference on Algorithms and Complexity(11th :2019 :, Rome, Italy)
مبدا اصلی
تاريخ عمليات
20200823085527.0
قواعد فهرست نويسي ( بخش توصيفي )
pn
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب اطلاعات رکورد کتابشناسی
نوع ماده
[Book]
اطلاعات دسترسی رکورد
تكميل شده
Y
