I got this mail
Dear Praveen Sonare,
the hamiltonian circuit (HC) problem remains NP-complete when restricted to
chordal bipartite graphs (cbg) and becomes polynomial when restricted
further to bipartite distance hereditary graphs (bdhg). I'm not aware of
any "well established" class of graph
pls give clear question yaar..
On Sun, Mar 8, 2009 at 2:43 AM, Miroslav Balaz wrote:
> can you also provide description of bdhg,cbg or hyperlink to them.
> Is this question hard? I am not graph expert.
>
> 2009/3/7 Monty
>
>
>> the hamiltonian circuit (HC) problem remains NP-complete when
>>
Abacus is the annual international Technical Symposium of the
Department of Computer Science, College of Engineering, Guindy- Anna
University. We conduct events which test the skill and knowledge of
participants in several fields related to computer science.
Abacus'09 is scheduled on March 20-21,
Abacus is the annual international Technical Symposium of the
Department of Computer Science, College of Engineering, Guindy- Anna
University. We conduct events which test the skill and knowledge of
participants in several fields related to computer science.
Abacus'09 is scheduled on March 20-21,
can you also provide description of bdhg,cbg or hyperlink to them.
Is this question hard? I am not graph expert.
2009/3/7 Monty
>
> the hamiltonian circuit (HC) problem remains NP-complete when
> restricted to chordal bipartite graphs (cbg) and becomes polynomial
> when restricted further to bip
C A L LF O RP A P E R S
===
The 2009 International Conference on Computer
Graphics and Virtual Reality
CGVR'09
Date and Location: July 13-16, 2009, Las Vegas, USA
h
the hamiltonian circuit (HC) problem remains NP-complete when
restricted to chordal bipartite graphs (cbg) and becomes polynomial
when restricted further to bipartite distance hereditary graphs
(bdhg). I'm not aware of
any "well established" class of graphs between bdhg and cbg. If there
is one, y
