3265 search results - page 65 / 653 » Representing Groups on Graphs |
117
Voted
ISCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
135
Voted
MMMACNS
2005
Springer
15 years 9 months ago
2005
Springer
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with both subjects...
124
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
139
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
144
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...