5100 search results - page 659 / 1020 » The Linear Complexity of a Graph |
204
Voted
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
180
click to vote
IJAC
2008
15 years 6 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
195
click to vote
IJNSEC
2008
15 years 6 months ago
2008
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...
189
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...