Topic

# Path graph

About: Path graph is a(n) research topic. Over the lifetime, 2613 publication(s) have been published within this topic receiving 53539 citation(s).

##### Papers
More filters
Journal ArticleDOI
TL;DR: An algorithm, which for fixed k ≥ 0 has running time O (| V(G) | 3 ), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs.
Abstract: We describe an algorithm, which for fixed k ≥ 0 has running time O (| V(G) | 3 ), to solve the following problem: given a graph G and k pairs of vertices of G , decide if there are k mutually vertex-disjoint paths of G joining the pairs.

1,304 citations

Journal ArticleDOI
Abstract: Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than ${2n / 3}$ vertices, and C contains no more than $2\sqrt 2 \sqrt n$ vertices. We exhibit an algorithm which finds such a partition A, B, C in $O( n )$ time.

1,283 citations

Journal ArticleDOI
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths and each iteration produces a new path between two vertices already on paths.
Abstract: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph into simple paths of iterative and each iteration produces a new path between two vertices already on paths. (The start vertex can be specified dynamically.) If V is the number of vertices and E is the number of edges, each algorithm requires time and space proportional to max (V, E) when executed on a random access computer.

901 citations

Journal ArticleDOI
TL;DR: Here the authors obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3.9±0.1 is obtained.
Abstract: Recently, Barabasi and Albert  suggested modeling complex real-world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In  and, with Jeong, in , Barabasi and Albert suggested that after many steps the proportion P(d) of vertices with degree d should obey a power law P(d)αd−γ. They obtained γ=2.9±0.1 by experiment and gave a simple heuristic argument suggesting that γ=3. Here we obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18, 279–290, 2001

848 citations

Journal ArticleDOI
TL;DR: The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i.
Abstract: Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin vertices of degree i. In  the authors essentially show that if ∑i(i−2)λi>0 then the graph a.s. has a giant component, while if ∑i(i−2)λi<0 then a.s. all components in the graph are small. In this paper we analyse the size of the giant component in the former case, and the structure of the graph formed by deleting that component. We determine e, λ′0, λ′1 … such that a.s. the giant component, C, has en+o(n) vertices, and the structure of the graph remaining after deleting C is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i.

820 citations

##### Network Information
###### Related Topics (5)
Chordal graph

12.8K papers, 314.2K citations

89% related
Line graph

11.5K papers, 304.1K citations

88% related
Directed graph

12.2K papers, 302.4K citations

87% related
Vertex (geometry)

18.7K papers, 294.2K citations

87% related
Time complexity

36K papers, 879.5K citations

86% related
##### Performance
###### Metrics
No. of papers in the topic in previous years
YearPapers
20221
202136
202030
201936
201849
201794