1952 search results - page 130 / 391 » Complete partitions of graphs |
155
click to vote
LCPC
1999
Springer
15 years 8 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
126
click to vote
ICEBE
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper investigates profit optimisation by the partitioning of server pools. Different types of web requests are considered in this paper: best-effort requests and multi-class...
108
click to vote
DM
2000
15 years 4 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
147
click to vote
LOGCOM
2010
14 years 11 months ago
2010
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
284
click to vote
CSL
2011
Springer
14 years 11 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...