2612 search results - page 4 / 523 » Switching Graphs and Their Complexity |
DM
2007
13 years 7 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
ISLPED
1995
ACM
13 years 11 months ago
1995
ACM
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. ...
WG
2007
Springer
14 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...