Complexity results for identifying codes in planar graphs

2010 ◽  
Vol 17 (6) ◽  
pp. 691-710 ◽  
Author(s):  
David Auger ◽  
Irène Charon ◽  
Olivier Hudry ◽  
Antoine Lobstein
Author(s):  
Carla Binucci ◽  
Emilio Di Giacomo ◽  
Walter Didimo ◽  
Fabrizio Montecchiani ◽  
Maurizio Patrignani ◽  
...  

Author(s):  
Akane SETO ◽  
Aleksandar SHURBEVSKI ◽  
Hiroshi NAGAMOCHI ◽  
Peter EADES

Author(s):  
Ryo ASHIDA ◽  
Sebastian KUHNERT ◽  
Osamu WATANABE
Keyword(s):  

Author(s):  
Garrett Cullity

Three things often recognized as central to morality are concern for others’ welfare, respect for their self-expression, and cooperation in worthwhile collective activity. When philosophers have proposed theories of the substance of morality, they have typically looked to one of these three sources to provide a single, fundamental principle of morality—or they have tried to formulate a master-principle for morality that combines these three ideas in some way. This book views them instead as three independently important foundations of morality. It sets out a plural-foundation moral theory with affinities to that of W. D. Ross. There are major differences: the account of the foundations of morality differs from Ross’s, and there is a more elaborate explanation of how the rest of morality derives from them. However, the overall aim is similar. This is to illuminate the structure of morality by showing how its complex content is generated from a relatively simple set of underlying elements—the complexity results from the various ways in which one part of morality can derive from another, and the various ways in which the derived parts of morality can interact. Plural-foundation moral theories are sometimes criticized for having nothing helpful to say about cases in which their fundamental norms conflict. Responding to this, the book concludes with three detailed applications of the theory: to the questions surrounding paternalism, the use of others as means, and our moral responsibilities as consumers.


2021 ◽  
Vol 392 ◽  
pp. 125723
Author(s):  
Ruijuan Gu ◽  
Hui Lei ◽  
Yulai Ma ◽  
Zhenyu Taoqiu

2019 ◽  
Vol 15 (3) ◽  
pp. 1-18 ◽  
Author(s):  
Saeed Akhoondian Amiri ◽  
Stefan Schmid ◽  
Sebastian Siebertz
Keyword(s):  

Author(s):  
Vida Dujmović ◽  
Louis Esperet ◽  
Pat Morin ◽  
Bartosz Walczak ◽  
David R. Wood

Abstract A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$ . The previous best bound was $O(\Delta^{37})$ . This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$ . The best previous bound for this result was exponential in $\Delta$ .


Sign in / Sign up

Export Citation Format

Share Document