Results 271 to 280 of about 89,470 (312)
Graphs and Combinatorics, 2011 For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is a pair of adjacent vertices in $G$.
Ruy Fabila-Monroy +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2020
The authors have carried out an examination of the status of tokens and tokenization in financial markets with regulatory problems, which lack proposals for solutions based on a generalized consensus. Overall, it seems to authors that cutting the Gordian knot of tokenization and tokens is the essential need to achieve a consensual and efficient ...
Carlos Fernandez-Herraiz +2 more
openaire +1 more source
The authors have carried out an examination of the status of tokens and tokenization in financial markets with regulatory problems, which lack proposals for solutions based on a generalized consensus. Overall, it seems to authors that cutting the Gordian knot of tokenization and tokens is the essential need to achieve a consensual and efficient ...
Carlos Fernandez-Herraiz +2 more
openaire +1 more source
International Journal of Computer Mathematics: Computer Systems Theory, 2021
We investigate a new variation of a token reconfiguration problem on graphs using the cyclic shift operation. A colored or labeled token is placed on each vertex of a given graph, and a “move” consists in choosing a cycle in the graph and shifting tokens by one position along its edges.
Win Hlaing Hlaing Myint +2 more
openaire +1 more source
We investigate a new variation of a token reconfiguration problem on graphs using the cyclic shift operation. A colored or labeled token is placed on each vertex of a given graph, and a “move” consists in choosing a cycle in the graph and shifting tokens by one position along its edges.
Win Hlaing Hlaing Myint +2 more
openaire +1 more source
Software: Practice and Experience, 2001
AbstractA common problem when writing compilers for programming languages or little, domain‐specific languages is that an input token may have several interpretations, depending on context. Solutions to this problem demand programmer intervention, obfuscate the language's grammar, and may introduce subtle bugs.
John Aycock, R. Nigel Horspool
openaire +2 more sources
AbstractA common problem when writing compilers for programming languages or little, domain‐specific languages is that an input token may have several interpretations, depending on context. Solutions to this problem demand programmer intervention, obfuscate the language's grammar, and may introduce subtle bugs.
John Aycock, R. Nigel Horspool
openaire +2 more sources
Externalism and token-token identity
Philosophia, 1995Selon la theorie de l'identite de pure forme (token-token) de l'esprit et du corps, les signes evenementiels de l'esprit, compris comme des occurrences donnees concretement et particulierement, sont identiques aux signes evenementiels physiques, compris de facon semblable. Dans le cadre de cette theorie, l'A.
openaire +1 more source