• Nenhum resultado encontrado

J. Braz. Comp. Soc. vol.9 número1

N/A
N/A
Protected

Academic year: 2018

Share "J. Braz. Comp. Soc. vol.9 número1"

Copied!
8
0
0

Texto

(1)

! "

!

of a Graph and Applications

Sulamita Klein

Instituto de Matemática and COPPE/Sistemas, UFRJ

CP 68511, 21945-970 - Rio de Janeiro, RJ, Brazil

e-mail: sula@cos.ufrj.br

4

2

$℄

"

5 "

3 !

3

2

2

$℄2

$℄2

!

2

$℄2

.

2

3

'

"

"

"

' (

Jaime L. Szwarcfiter

Instituto de Matemática NCE and COPPE/Sistemas, UFRJ

CP 2324, 20001-970 - Rio de Janeiro, RJ, Brazil

e-mail: jayme@nce.ufrj.br

Abstract

Keywords:

graphs, ideals, modules, posets, bipartite

tournaments, algorithms

"

!

# $%℄ ' $( ) * + , -( -)℄ .

$-/-0---1℄

" 2

2 3

$℄2

(2)

v

1

v

2

v

3

v

4

v

7

v

5

v

6

G

3- #

v

2

v

3

v

4

v

7

v

5

v

6

D

1

3(

½

½

4

"

! 3

2

--

-(

(-

((

v

3

,

v

4

v

5

,

v

6

v

2

v

7

1

C

1

x

x

x

x

2

4

3

3)

½

½

x

1

P

1

x

3

x

2

x

4

31

½

½

3!

'3-61"

4

7

'

5

8

"

$1℄

9

(3)

4

4

:

4 "

"

2-

.

"

;

"

3

. -- -(

.

; (-

((

<=(

0- "

"

;= (

.

0 .

- 4.

0 . 2

Ë

¾

.

- 0

'

"

;

"

;

-- -(

(- ((

"

>

" -

0 5>

5

"

4

" 42

Ë

¾

.22

8"

2.

8

3" > '

2

'

-- -(

7

¼

¼¼

;

¼

¼¼

<

<

2

5>2

"

;(-

.

"

;

<5 -

;((

.

5 -

¼

¼

5>

¼

<

¼

;-(

5 (

(4)

--

<

' 5

'

3" 3-

"

½

½

½

31

2

2

2

2

2

2

2

2

2

2

2

2

-

. >

4

>

Ë

2

2

2 Ë

5

> '

-

Æ

4

4

"

0

-

(

' "

"

"

0(

7

0

2

-

2

(

$℄2

4

5

0

4

" -- -( (- ((

(-

<

(- 5>

'

" 5

>

0

.

-(

((

(5)

0 (

:

' 5 ( -( ((

5>

-' 5 -

- (

5 )

(

4

5 (

:

4

0 "

5 -( )

2

½

¾

. - 5 (1 %

2

¼

¾

(

$℄ 2

5 )%

* =1

. >

½

"

4

'

?

;=1

0@-@

( " 5>

A ( " "

" 0 (

'

"

·½

;

:

5

>

·½

( '

¼

¼

·½

¼

¼

;=

1

·½

5>

0

·½

- =

1

>

4

4

½

7

¼

¼¼

!

;

¼

¼¼

8

¼

¼¼

?

?

'

.

5>

;

"

7! 2

!

> 4

¼

½

2

?

!

¼

½

¼

>

½

. !

¼

½

3

¼

½

:

"

.

" :

5

2

>

;

2

¼

is of type 2 implics that y can not exist. Consequentely,

(6)

2

½

'

¼

>-- -(

¼

' (- ((

½

3

¼

½

-(

' ((

8

¼

½

.

¼

½

5>

2

'

;

<

)

¾

.

"

.

!

½

¼

- !

2

¼

Ë

½

4

"

Ì

2

½

½

4

2

Ë

½

5

5

2

-

2

Ë

½

¾

B-

½

"

½

½

7!

½

.2-

2

-

2

Ë ½

·

$℄

5

"

½

½

½

½

4

½

½

; -

A 2

Ë

. 2

4-

"

·

$℄

- ;

5

;-2

Ë

'

"

- 5>

½

½

¾

=* 5

½

3

-

½

#

Ë

#

>

)

=% >

(7)

! ¿

C" "

"!

¾

"

-) =% *

"

½

"

½

½

"2C

½

½ (

-

>

! ¿

5!

;

!! "

!

"

4

½

4

# 2

#

7

¼

2

2

½

3

!"

$

$

#$ $

"

"

$ "

#

½

$

#

$

$

#$

2

2

2

-

$

! "

$

$

.

!

½

!2-%20 2

.

!$

% -

" 2%2-

8

" !

¾

C

"

!$

%&" !"

!

= ,

!

4 & &

2 ' &

&

' )

½

2

½

2

(

½

2 -

2 -

½

4

;=%

¼

½

'

(8)

2

½

2

' -

2

3 2 - "

.

2

5

2 '

"

2

2 ;

½

½

5>

¼

 ½

 ½

<

"

. !

½

'

3

.

¾

!

" .

:

! "

!

"

" ! "

$ !

"

!

C" !

!

C

"

!$ !

)*" 4

3 !

$-℄ ;; D<A

!

% &#-+06-,1-/,)

$(℄ 5 A <

'

'(()*+, -+ . '

/ ' 0

BE*,6,(-//1

$)℄ 7 F# DAA5

! )

(('!0.(!0

" ( (*6)%-//+

$1℄ <G # D A A5

'F' !

>

1( (,)6(/1-//1

$%℄ # (

( 0 #(%6**-/*+

$*℄ A5# #

=# ( GH:-/,0

$+℄ A < A 5A 8 I?

" (

!(0-6(0+-/+/

$,℄ 7 E 5 . D

2%D;)610-/,%

$/℄ D A A5 F ' 4

Æ

)

$ (('!0.(!0

" ( %)*6%1%-//1

$-0℄ D A A5 F ' 4

)

( ('!0.(! 0 " (

-/6(%-//+

$--℄ DAA5 F' A

JJ JJ:

-//+

$-(℄ F<A F' .

1 ( ' -6

-/-/,/

$-)℄ D < A

. D

2%D;

1-6-0--/,%

$-1℄ F'

" ( !'(*)6(/--//(

Referências

Documentos relacionados

Theorem 4.2 Regular translations realized by state- deterministic finite transducers are inferable in linear time from positive samples only.. Almost state-deterministic

Therefore, it allows a better delay control for real-time traffic in high load situations and a geater channel use for best effort traffic when low real-time traffic is present in

Proof obligations containing set theory constructs are translated to first-order logic with equality aug- mented with (an extension of) the theory of arrays with extensionality.

For example, in figure 2 we show an example of similarity with respect to logical connectives between the formulas and (for legibility reasons, each represents a ground

In the previous section we introduce Phi–calculus as a model for the design of DLEs under a particular perspective: the one of the exchanges taking place between a

[r]

[r]

This paper presents ODEd, an ontology editor that supports the definition of con- cepts, relations and properties, using graphic representations, besides promoting automatic