702 search results - page 5 / 141 » Identifying Graph Automorphisms Using Determining Sets |
ICWE
2005
Springer
14 years 1 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...
TIT
1998
13 years 8 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 ...
AAMAS
2012
Springer
12 years 4 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 ...
INFOCOM
1997
IEEE
14 years 19 days 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...
CP
2010
Springer
13 years 6 months 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...