3008 search results - page 82 / 602 » Independence in connected graphs |
108
click to vote
WAOA
2007
Springer
15 years 7 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
99
Voted
DM
2002
15 years 20 days ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
106
Voted
MP
2007
15 years 10 days ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
189
Voted
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
109
Voted
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...