Skip to search formSkip to main contentSkip to account menu

Claw-free permutation

Known as: Claw (cryptography), Claw-free 
In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 if f0… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Collision resistanceCommitment schemeComputer scienceCryptographic hash function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
P12-colorings of cubic graphs
If G and H are two cubic graphs, then an H-coloring of G is a proper edge-coloring f with edges of H , such that for each vertex… 
2017
2017
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes… 
2015
2015
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$
In this paper we show how to solve the \emph{Maximum Weight Stable Set Problem} in a claw-free graph $G(V, E)$ with $\alpha(G… 
2012
2012
Coloring claw-free graphs with \Delta-1 colors
We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1… 
2010
2010
Toughness and Matching Extension in P3-Dominated Graphs
Let G be a connected graph. For x, y ∈ V (G) with d(x, y) = 2, we define J (x, y) ={ u ∈ N (x) ∩ N (y) | N (u )⊆ N (x )∪ N (y… 
2009
2009
Total Restrained Domination in Cubic Graphs
A set S of vertices in a graph G = (V, E) is a total restrained dominating set (TRDS) of G if every vertex of G is adjacent to a… 
2009
2009
Induced paths with parity restriction in claw-free graphs
2006
2006
A claw-free permutation signature scheme
Consider the following scheme, known as the claw-free permutation signature scheme, for signing messages mi ∈ {0, 1} k where i… 
2004
2004
Triangularly connected claw-free graph
A graph G is triangularly connected if for every pair of edges e1, e2 ∈ E(G), G has a sequence of 3-cycles C1, C2, · · · , Cl… 
1995
1995
Vertex disjoint cycles for star free graphs
A graph is claw-free if it does not contain K I ,3 as an induced subgraph. A graph is KI,r-free if it does not contain KI,r as an…