702 search results - page 5 / 141 » Identifying Graph Automorphisms Using Determining Sets |
107
click to vote
ICWE
2005
Springer
15 years 7 months ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
106
Voted
TIT
1998
15 years 1 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
141
Voted
AAMAS
2012
Springer
13 years 10 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
118
click to vote
INFOCOM
1997
IEEE
15 years 6 months ago
1997
IEEE
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...
126
Voted
CP
2010
Springer
15 years 6 days ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...