Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Sciriha, I.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN031704 / BLDSC - British Library D...

Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM

Sajith, G.
Saxena, Sanjeev

February 1996

AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...

Use of colour in machine vision Colour representation, edge detection with colour, segmentation of colour space and colour constancy

Hung, T.W.R.

January 1999

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034235 / BLDSC - British Library D...

Graph-colouring algorithms with applications to timetabling problems

Abou Naaj, M.S.

January 1983

SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Edge-colouring and I-factors in graphs

Lienart, E.A.S.

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...

Graph colourings using structured colour sets

Johnson, A.

January 2001

Available from British Library Document Supply Centre-DSC:DXN046348 / BLDSC - British Library Docume...

Optimally edge-colouring outerplanar graphs is in NC

Gibbons, Alan
Rytter, Wojciech

April 1990

AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...

Colour segmentation with edge detection

Wang, H
Dew, P.M
Leeds Univ. (United Kingdom). School of Computer Studies

January 1988

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS-RR--88/19) / BLDSC -...

Very fast parallel algorithms for approximate edge coloring

Han, Yijie
Liang, Weifa
Shen, Xiaojun

March 2001

AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...

Very fast parallel algorithms for approximate edge coloring

Han, Yijie
Liang, Weifa
Shen, Xiaojun

December 2015

This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...

A fast parallel algorithm for optimal edge-colouring of outerplanar graphs

Gibbons, Alan (Alan M.)
Rytter, Wojciech

We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...

A multilevel approach to the graph colouring problem

Walshaw, C.
Greenwich Univ., London (United Kingdom). Centre for Numerical Modelling and Process Analysis

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...

A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Jerrum, M
Edinburgh Univ. (United Kingdom). Lab. for Foundations of Computer Science

January 1994

SIGLEAvailable from British Library Document Supply Centre- DSC:5186.0913(EU-ECS-LFCS--94-290) / BLD...

Nearly optimal distributed edge colouring in O(log log n) rounds

David A. Grable
Alessandro Panconesi

January 1997

An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020626 / BLDSC - British Library D...

On some aspects of graph spectra

Sciriha, I.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN031704 / BLDSC - British Library D...

Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM

Sajith, G.
Saxena, Sanjeev

February 1996

AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...

Use of colour in machine vision Colour representation, edge detection with colour, segmentation of colour space and colour constancy

Hung, T.W.R.

January 1999

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034235 / BLDSC - British Library D...

Graph-colouring algorithms with applications to timetabling problems

Abou Naaj, M.S.

January 1983

SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Edge-colouring and I-factors in graphs

Lienart, E.A.S.

January 2000

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...

Graph colourings using structured colour sets

Johnson, A.

January 2001

Available from British Library Document Supply Centre-DSC:DXN046348 / BLDSC - British Library Docume...

Optimally edge-colouring outerplanar graphs is in NC

Gibbons, Alan
Rytter, Wojciech

April 1990

AbstractWe prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time...

Colour segmentation with edge detection

Wang, H
Dew, P.M
Leeds Univ. (United Kingdom). School of Computer Studies

January 1988

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.555(LU-SCS-RR--88/19) / BLDSC -...

Very fast parallel algorithms for approximate edge coloring

Han, Yijie
Liang, Weifa
Shen, Xiaojun

March 2001

AbstractThis paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n...

Very fast parallel algorithms for approximate edge coloring

Han, Yijie
Liang, Weifa
Shen, Xiaojun

December 2015

This paper presents very fast parallel algorithms for approximate edge coloring. Let log(1)n=logn,lo...

A fast parallel algorithm for optimal edge-colouring of outerplanar graphs

Gibbons, Alan (Alan M.)
Rytter, Wojciech

We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynom...

A multilevel approach to the graph colouring problem

Walshaw, C.
Greenwich Univ., London (United Kingdom). Centre for Numerical Modelling and Process Analysis

January 2001

SIGLEAvailable from British Library Document Supply Centre-DSC:6370.933(no 01/69) / BLDSC - British ...

A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Jerrum, M
Edinburgh Univ. (United Kingdom). Lab. for Foundations of Computer Science

January 1994

SIGLEAvailable from British Library Document Supply Centre- DSC:5186.0913(EU-ECS-LFCS--94-290) / BLD...

Nearly optimal distributed edge colouring in O(log log n) rounds

David A. Grable
Alessandro Panconesi

January 1997

An extremely simple distributed randomized edge colouring algorithm is given which produces with hig...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020626 / BLDSC - British Library D...

On some aspects of graph spectra

Sciriha, I.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN031704 / BLDSC - British Library D...

Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM

Sajith, G.
Saxena, Sanjeev

February 1996

AbstractGiven a graph, in which degree of every node is at most Δ > 2, we give an algorithm for vert...

Use of colour in machine vision Colour representation, edge detection with colour, segmentation of colour space and colour constancy

Hung, T.W.R.

January 1999

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034235 / BLDSC - British Library D...

Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Abstract

Extracted data

Parallel O(log(n))-time edge-colouring of trees and Halin graphs

Abstract

Extracted data

Related items

Related items