2612 search results - page 164 / 523 » Switching Graphs and Their Complexity |
105
click to vote
MST
2008
15 years 26 days ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
108
click to vote
RSA
2000
15 years 20 days ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
116
click to vote
WEBI
2007
Springer
15 years 7 months ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
103
click to vote
PPAM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
125
click to vote
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...