3105 search results - page 101 / 621 » The Path-Packing Structure of Graphs |
DAM
2010
15 years 3 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
151
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
115
click to vote
BIRTHDAY
2005
Springer
15 years 8 months ago
2005
Springer
In the beginning, one of the main fields of application of graph transformation was biology, and more specifically morphology. Later, however, it was like if the biological appli...
103
click to vote
DM
2010
15 years 3 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
105
click to vote
ENTCS
2008
15 years 3 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...