3471 search results - page 376 / 695 » Obstacle Numbers of Graphs |
182
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
195
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
170
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
200
click to vote
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
192
click to vote
EUROISI
2008
15 years 8 months ago
2008
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...