Sciweavers

3265 search results - page 65 / 653
» Representing Groups on Graphs
Sort
View
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
16 years 6 days ago
Visualizing and Managing Network Topologies via Rectangular Dualization
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 ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
MMMACNS
2005
Springer
15 years 11 months ago
Foundation for a Time Interval Access Control Model
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...
Francis B. Afinidad, Timothy E. Levin, Cynthia E. ...
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
The minimum linear arrangement problem on proper interval graphs
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 ...
Ilya Safro
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
16 years 1 months ago
Context-Aware Object Connection Discovery in Large Graphs
— 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...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
FOCS
2002
IEEE
15 years 11 months ago
Graph Isomorphism is in SPP
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...
Vikraman Arvind, Piyush P. Kurur