296 search results - page 29 / 60 » Group connectivity of certain graphs |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
FCT
2003
Springer
14 years 23 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
FPL
2007
Springer
13 years 11 months ago
2007
Springer
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...