717 search results - page 34 / 144 » The Viewing Graph |
EPIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
CSMR
2007
IEEE
14 years 3 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
IWOCA
2010
Springer
13 years 3 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
IV
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
VL
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper shows how integrated UML models combining class, object, use-case, collaboration and state diagrams can be animated in a domain-specific layout. The presented approach...