677 search results - page 85 / 136 » Bipartite roots of graphs |
CCE
2008
14 years 12 months ago
2008
We review the use of bond graphs for modeling of physico-chemical processes. We recall that bond graphs define a circuit-type language which root on a thermodynamical consistent d...
KDD
2003
ACM
16 years 8 days ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
122
click to vote
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
106
click to vote
JGT
2011
14 years 6 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...