PDF Archive

Easily share your PDF documents with your contacts, on the Web and Social Networks.

Share a file Manage my documents Convert Recover PDF Search Help Contact


Search


PDF Archive search engine
Last database update: 20 September at 23:07 - Around 220000 files indexed.

Show results per page

Results for «edges»:


Total: 4000 results - 0.062 seconds

54I18-IJAET0118732 v6 iss6 2791-2794 100%

University, Rohtak (Haryana), India ABSTRACT An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1,2,……………,p+q such that for every edge the sum of the label of edge and the label of its two end vertices are constant.

https://www.pdf-archive.com/2014/07/04/54i18-ijaet0118732-v6-iss6-2791-2794/

04/07/2014 www.pdf-archive.com

6N19-IJAET0319318 v7 iss1 59-65 99%

The results of experiments show that it performs better to find edges for low resolution angiography images.

https://www.pdf-archive.com/2014/07/04/6n19-ijaet0319318-v7-iss1-59-65/

04/07/2014 www.pdf-archive.com

GraphTheoryAndCombinatoricsUnit2 99%

In some drawing representing graphs the edges intersect (cross over) at points which are not vertices of the graph and in some others the edges meet only at the vertices.

https://www.pdf-archive.com/2015/08/23/graphtheoryandcombinatoricsunit2/

23/08/2015 www.pdf-archive.com

GraphTheoryAndCombinatoricsUnit3 99%

set V of vertices and set E of edges.

https://www.pdf-archive.com/2015/08/23/graphtheoryandcombinatoricsunit3/

23/08/2015 www.pdf-archive.com

DataStructureUnit6 96%

E is a set of pairs of vertices, these pairs are called edges.

https://www.pdf-archive.com/2015/08/23/datastructureunit6/

23/08/2015 www.pdf-archive.com

shortestpath 95%

In each iteration the algorithm puts a new edge into F , and since the number of edges is finite, the algorithm eventually terminates.

https://www.pdf-archive.com/2016/02/12/shortestpath/

12/02/2016 www.pdf-archive.com

GraphTheoryAndCombinatoricsUnit1 95%

H1 H2 H3 W G E Fig(1.4)- three – utilities problem Fig(1.4) shows how this problem can be represented by a graph – the conduits are shown as edges while the houses and utility supply centers are vertices 4.

https://www.pdf-archive.com/2015/08/23/graphtheoryandcombinatoricsunit1/

23/08/2015 www.pdf-archive.com

Rubik’s Cube Beginners Solution 95%

 Bottom  Layer  (White)  Corners   Surrounding  the  yellow  center  with  the  white   edges  first  may  help.

https://www.pdf-archive.com/2011/03/23/rubik-s-cube-beginners-solution/

23/03/2011 www.pdf-archive.com

Algorithm7-13 94%

Then we will recreate all edges from E and create an edge for each pair va and vb such that E 0 = {(ub , va ) :

https://www.pdf-archive.com/2016/04/25/algorithm7-13/

25/04/2016 www.pdf-archive.com

22I20-IJAET0520903 v7 iss2 477-487 93%

2.1 Edge Histogram Descriptor The edge histogram descriptor captures the spatial distribution of edges.

https://www.pdf-archive.com/2014/07/04/22i20-ijaet0520903-v7-iss2-477-487/

04/07/2014 www.pdf-archive.com

7I10-IJAET0520952 v7 iss2 352-358 93%

International Journal of Advances in Engineering &

https://www.pdf-archive.com/2014/07/04/7i10-ijaet0520952-v7-iss2-352-358/

04/07/2014 www.pdf-archive.com