Results 1  10
of
3,331
Decomposition of graphs into induced paths and cycles
 International Journal of Computational and Mathematical Sciences
"... Abstract—A decomposition of a graph G is a collection ψ of subgraphs H1,H2,..., Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, thenψ is called an induced path decomposition of G. The minimum cardinality of an induced path d ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract—A decomposition of a graph G is a collection ψ of subgraphs H1,H2,..., Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, thenψ is called an induced path decomposition of G. The minimum cardinality of an induced path
Finding and listing induced paths
, 2010
"... Many recognition problems for special classes of graphs can be reduced to finding and listing induced paths in a graph. We design algorithms to list all P3’s in O(m1.5 + p3(G)) time, and for k ≥ 4 all Pk’s in O(nk−1 + pk(G) + k · ck(G)) time, where pk(G), respectively, ck(G), are the number of Pk’s, ..."
Abstract
 Add to MetaCart
Many recognition problems for special classes of graphs can be reduced to finding and listing induced paths in a graph. We design algorithms to list all P3’s in O(m1.5 + p3(G)) time, and for k ≥ 4 all Pk’s in O(nk−1 + pk(G) + k · ck(G)) time, where pk(G), respectively, ck(G), are the number of Pk
Equiparity induced path decomposition in trees
"... A decomposition of a graph G is a collection ψ = {H1,H2,...,Hk} of subgraphs of G such that every edge ofG belongs to exactly oneHi. The decomposition ψ is called a path decomposition of G if each Hi is a path in G. Several studies have been undertaken on path decompositions by imposing certain con ..."
Abstract
 Add to MetaCart
conditions on the paths considered in the decomposition of the graph where the primary objective is to obtain the minimum number of paths required for a certain type of decomposition for a given graph. A path decomposition ψ such that the paths in ψ are induced as well as of same parity is defined
Finding and listing induced paths and cycles
, 2012
"... Many recognition problems for special classes of graphs and cycles can be reduced to finding and listing induced paths and cycles in a graph. We design algorithms to list all P3’s in O(m1.5 + p3(G)) time, and for k ≥ 4 all Pk’s in O(nk−1 +pk(G)+k·ck(G)) time, where pk(G), respectively, ck(G), are th ..."
Abstract
 Add to MetaCart
Many recognition problems for special classes of graphs and cycles can be reduced to finding and listing induced paths and cycles in a graph. We design algorithms to list all P3’s in O(m1.5 + p3(G)) time, and for k ≥ 4 all Pk’s in O(nk−1 +pk(G)+k·ck(G)) time, where pk(G), respectively, ck
FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO Artificial Intelligence
, 1986
"... Scope and PurposeA summary is provided of some of the recent (and a few notsorecent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and arti ..."
Abstract

Cited by 379 (8 self)
 Add to MetaCart
and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
Induced matchings and induced paths in graphs
 Unpublished manuscript, KAMDIMATIA Series
, 2007
"... Abstract. Denote by ∇1(G) the maximum of E(H) over all (simple) minors V (H) of G obtained by contracting a star forest. We prove that there exists a positive function ɛ such that every graph G of order n has (at least) two clones (that is two vertices with the same neighbours) or an induced mat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
))n ⌋ inducing ⌊ɛk(∇⌊k/2⌋(G))n ⌋ disjoint paths on k vertices. 1.
Induced matchings and induced paths in graphs
 UNPUBLISHED MANUSCRIPT, KAMDIMATIA SERIES
, 2007
"... Denote by ∇1(G) the maximum of E(H) over all (simple) minors V (H) of G obtained by contracting a star forest. We prove that there exists a positive function ǫ such that every graph G of order n has (at least) two clones (that is two vertices with the same neighbours) or an induced matching of ..."
Induced paths in twinfree graphs
 Electron. J. Combin
, 2008
"... Let G = (V, E) be a simple, undirected graph. Given an integer r ≥ 1, we say that G is rtwinfree (or ridentifiable) if the balls B(v, r) for v ∈ V are all different, where B(v, r) denotes the set of all vertices which can be linked to v by a path with at most r edges. These graphs are precisely t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the ones which admit ridentifying codes. We show that if a graph G is rtwinfree, then it contains a path on 2r + 1 vertices as an induced sugbraph, i.e. a chordless path.
pathChirp: Efficient Available Bandwidth Estimation for Network Paths
 In Passive and Active Measurement Workshop
, 2003
"... This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "selfinduced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several signifi ..."
Abstract

Cited by 317 (4 self)
 Add to MetaCart
This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "selfinduced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several
A Novel Knowledgeinduced Path Planning Strategy for The
, 2008
"... Robot path planning is to obtain a most reasonable collisionfree path in a certain environment. Existing method can ensure that the solution is the optimal or nearoptimal path satisfying some criterion. However, the convergence speed and computation complexity of these methods are limited because ..."
Abstract
 Add to MetaCart
they have not utilize knowledge embodied in the problem enough. Therefore, a novel knowledgeinduced path planning strategy (KIPP) is proposed. Here, two kinds of knowledge, including explicit knowledge and implicit knowledge, are defined. Explicit knowledge memorizes the information about obstacles which
Results 1  10
of
3,331