Matches in SemOpenAlex for { <https://semopenalex.org/work/W2425410103> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2425410103 abstract "In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem is computing a minimum base S for a permutation group G on [n] given by generators, i.e., a minimum cardinality subset S of [n] such that no nontrivial permutation in G fixes all elements of S. Our focus is mainly on the parameterized complexity of these problems. We show that when k=|S| is treated as parameter, then both problems are MINI[1]-hard. For the dual problems, where k=n-|S| is the parameter, we give FPT algorithms. A notion closely related to fixing is called individualization. Individualization combined with the Weisfeiler-Leman procedure is a fundamental technique in algorithms for Graph Isomorphism. Motivated by the power of individualization, in the present paper we explore the complexity of individualization: what is the minimum number of vertices we need to individualize in a given graph such that color refinement succeeds on it. Here succeeds could have different interpretations, and we consider the following: It could mean the individualized graph becomes: (a) discrete, (b) amenable, (c) compact, or (d) refinable. In particular, we study the parameterized versions of these problems where the parameter is the number of vertices individualized. We show a dichotomy: For graphs with color classes of size at most 3 these problems can be solved in polynomial time (even in logspace), while starting from color class size 4 they become W[P]-hard." @default.
- W2425410103 created "2016-06-24" @default.
- W2425410103 creator A5003212467 @default.
- W2425410103 creator A5049298979 @default.
- W2425410103 creator A5056964913 @default.
- W2425410103 creator A5060883112 @default.
- W2425410103 creator A5087543886 @default.
- W2425410103 date "2016-06-14" @default.
- W2425410103 modified "2023-10-14" @default.
- W2425410103 title "The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs" @default.
- W2425410103 cites W1475836543 @default.
- W2425410103 cites W1519147138 @default.
- W2425410103 cites W1973322735 @default.
- W2425410103 cites W1990600049 @default.
- W2425410103 cites W2001663593 @default.
- W2425410103 cites W2003282281 @default.
- W2425410103 cites W2006771561 @default.
- W2425410103 cites W2018964411 @default.
- W2425410103 cites W2023412135 @default.
- W2425410103 cites W2065259180 @default.
- W2425410103 cites W2078462949 @default.
- W2425410103 cites W2106393052 @default.
- W2425410103 cites W2121634574 @default.
- W2425410103 cites W2125005237 @default.
- W2425410103 cites W2131829133 @default.
- W2425410103 cites W2166162093 @default.
- W2425410103 cites W2173290940 @default.
- W2425410103 cites W2181072414 @default.
- W2425410103 cites W2190928263 @default.
- W2425410103 cites W2287453393 @default.
- W2425410103 cites W2798943694 @default.
- W2425410103 cites W54441500 @default.
- W2425410103 cites W621643794 @default.
- W2425410103 doi "https://doi.org/10.48550/arxiv.1606.04383" @default.
- W2425410103 hasPublicationYear "2016" @default.
- W2425410103 type Work @default.
- W2425410103 sameAs 2425410103 @default.
- W2425410103 citedByCount "0" @default.
- W2425410103 crossrefType "posted-content" @default.
- W2425410103 hasAuthorship W2425410103A5003212467 @default.
- W2425410103 hasAuthorship W2425410103A5049298979 @default.
- W2425410103 hasAuthorship W2425410103A5056964913 @default.
- W2425410103 hasAuthorship W2425410103A5060883112 @default.
- W2425410103 hasAuthorship W2425410103A5087543886 @default.
- W2425410103 hasBestOaLocation W24254101031 @default.
- W2425410103 hasConcept C11413529 @default.
- W2425410103 hasConcept C114614502 @default.
- W2425410103 hasConcept C118615104 @default.
- W2425410103 hasConcept C132525143 @default.
- W2425410103 hasConcept C165464430 @default.
- W2425410103 hasConcept C179799912 @default.
- W2425410103 hasConcept C311688 @default.
- W2425410103 hasConcept C33923547 @default.
- W2425410103 hasConcept C80899671 @default.
- W2425410103 hasConceptScore W2425410103C11413529 @default.
- W2425410103 hasConceptScore W2425410103C114614502 @default.
- W2425410103 hasConceptScore W2425410103C118615104 @default.
- W2425410103 hasConceptScore W2425410103C132525143 @default.
- W2425410103 hasConceptScore W2425410103C165464430 @default.
- W2425410103 hasConceptScore W2425410103C179799912 @default.
- W2425410103 hasConceptScore W2425410103C311688 @default.
- W2425410103 hasConceptScore W2425410103C33923547 @default.
- W2425410103 hasConceptScore W2425410103C80899671 @default.
- W2425410103 hasLocation W24254101031 @default.
- W2425410103 hasLocation W24254101032 @default.
- W2425410103 hasOpenAccess W2425410103 @default.
- W2425410103 hasPrimaryLocation W24254101031 @default.
- W2425410103 hasRelatedWork W1599634910 @default.
- W2425410103 hasRelatedWork W2123481932 @default.
- W2425410103 hasRelatedWork W2374778222 @default.
- W2425410103 hasRelatedWork W2953319076 @default.
- W2425410103 hasRelatedWork W4225665792 @default.
- W2425410103 hasRelatedWork W4285603334 @default.
- W2425410103 hasRelatedWork W4287725154 @default.
- W2425410103 hasRelatedWork W4294437661 @default.
- W2425410103 hasRelatedWork W4294702976 @default.
- W2425410103 hasRelatedWork W4306705875 @default.
- W2425410103 isParatext "false" @default.
- W2425410103 isRetracted "false" @default.
- W2425410103 magId "2425410103" @default.
- W2425410103 workType "article" @default.